FAQ

Bounding interval hierarchy

Known as: BIH 
A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd-trees. Bounding interval… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2018
05010015019732018

Related topics

Related topics

10 relations

Broader (1)

3D computer graphics
Binary treeBounding volume hierarchyCPU cacheData structure
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Bounding interval hierarchy
Heuristic
Data structure
3D computer graphics
CPU cache
Ray tracing (graphics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
GPU Volume Raycasting using Bounding Interval Hierarchies
Traditional Direct Volume Raycasting (DVR) on the GPU is limited to uniform voxel grids stored as 3D textures. This approach is… (More)
  • figure 1
  • table 2
  • table 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Classification of Electrocardiogram Signals With Support Vector Machines and Particle Swarm Optimization
The aim of this paper is twofold. First, we present a thorough experimental study to show the superiority of the generalization… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • table III
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Instant Ray Tracing: The Bounding Interval Hierarchy
We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to bounding volume hierarchies the… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A wavelet-based ECG delineator: evaluation on standard databases
In this paper, we developed and evaluated a robust single-lead electrocardiogram (ECG) delineation system based on the wavelet… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Automatic classification of heartbeats using ECG morphology and heartbeat interval features
A method for the automatic processing of the electrocardiogram (ECG) for the classification of heartbeats is presented. The… (More)
  • table I
  • table II
  • figure 1
  • figure 2
  • table III
Is this relevant?
Highly Cited
2003
Highly Cited
2003
An Open-source Algorithm to Detect Onset of Arterial Blood Pressure Pulses
In this paper; we present an effective algorithm for detecting the onset of anerial blood pressure (ABP) pulses. The algorithm… (More)
  • figure 1
  • figure 4
  • figure 5
  • table 2
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
ECG beat classification by a novel hybrid neural network
This paper presents a novel hybrid neural network structure for the classification of the electrocardiogram (ECG) beats. Two… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Clustering ECG complexes using Hermite functions and self-organizing maps
An integrated method for clustering of QRS complexes is presented which includes basis function representation and self… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Wavelet compression of ECG signals by the set partitioning in hierarchical trees algorithm
A wavelet electrocardiogram (ECG) data codec based on the set partitioning in hierarchical trees (SPIHT) compression algorithm is… (More)
  • figure 2
  • figure 1
  • table I
  • figure 3
  • table II
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Detection of ECG characteristic points using wavelet transforms
An algorithm based on wavelet transforms (WT's) has been developed for detecting ECG characteristic points. With the multiscale… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?