Repetitive Hidden Surface Removal for Polyhedra

@article{Pellegrini1996RepetitiveHS,
  title={Repetitive Hidden Surface Removal for Polyhedra},
  author={Marco Antonio Pellegrini},
  journal={J. Algorithms},
  year={1996},
  volume={21},
  pages={80-101}
}
The repetitive hidden-surface-removal problem can be rephrased as the problem of finding the most compact representation of all views of a polyhedral scene that allows efficient on-line retrieval of a single view. We assume that a polyhedral scene in 3-space is given in advance and is preprocessed off-line into a data structure. Afterward, the data structure is accessed repeatedly with viewpoints given on-line and the portions of the polyhedra visible from each viewpoint are produced on-line… 

An efficient parallel algorithm or visible-surface detection in 3d graphics display

This paper proposes an efficient parallel algorithm for implementation of the popular depth-buffer method on the general PRAM model that detects visible surfaces by projecting pixels on all surfaces to a 2D view plane and removing all hidden surfaces and analyses the scalability of the algorithm.

Geometric algorithms and data representation for solid freeform fabrication

An algorithm is developed for building the loop edge data structure (LEDS) efficiently from a boundary representation, even when it doesn't fit in main memory, improving software performance for highly tessellated parts by two orders of magnitude.

Efficient algorithms for geometric optimization

A wide range of applications of parametric searching and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other query-type problems.

CS-1996-19 E cient Algorithms for GeometricOptimizationPankaj

Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates

E cient Algorithms for Geometric Optimization

Linear Programming 15 not contain xR). If V = ;, the algorithm returns xR. If (V ) 3 (H)=d, we double the weight of each constraint in V ; in any case, we repeat the sampling procedure. See Figure 1

Visibilité tridimensionnelle : étude analytique et apllications

Les problemes de visibilite sont centraux pour bien des applications en synthese d'images. Les example les plus classiques sont le calcul de vue, les limites d'ombres, la visibilite mutuelle de

Efficient Hidden-Surface Removal in Theory and Practice

This thesis describes an algorithm for removing geometric and topological flaws, such as missing polygons and cracks, from the input, and presents the Binary Space Partition (BSP), a hierarchical spatial decomposition used to efficiently implement both the model repair and hidden-surface removal algorithms.

References

SHOWING 1-10 OF 43 REFERENCES

Dynamic Output-sensitive Hidden Surface Removal for C-oriented Polyhedra

Hidden surface removal for axis-parallel polyhedra

  • M. D. BergM. Overmars
  • Computer Science
    Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
An efficient, output-sensitive method for computing the visibility map of a set of axis-parallel polyhedra as seen from a given viewpoint, and can be extended even further to deal with intersectingpolyhedra with only a slight increase in the time bound.

Hidden Surface Removal for C-oriented Polyhedra

Efficient ray shooting and hidden surface removal

The ray-shooting structure for curtains is used to obtain an algorithm for computing the view of a set of nonintersecting prolyhedra, the first output-sensitive algorithm for this problem that does not need a depth order on the faces of the polyhedra.

Sparse Arrangements and the Number of Views of Polyhedral Scenes

This paper investigates arrangements of curves and of surfaces that have a certain sparseness property and shows that this type of arrangements (sparse arrangements) is relevant to the study of the maximum number of topologically different views of a polyhedral terrain.

Hidden surface removal with respect to a moving view point

Two algorithms for hidden surface removal with respect to a moving viewpoint are given, based on a certain View Dependent Partition of R3 that is induced by the scene polygons.

Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects

This work presents an efficient algorithm for computing the viewing data for line drawings of polyhedral objects under orthographic projection, and constructs the set of all views in optimal O(m) time and space.

Computing the aspect graph for line drawings of polyhedral objects

  • Z. GigusJitendra Malik
  • Computer Science
    Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition
  • 1988
The authors present an algorithm for computing the viewing data of polyhedral objects and provide a full catalog of the visual events that occur for this type of object.

Efficient hidden surface removal for objects with small union size

Removal for Objects Mark H. Overmars~ with Small Union Size* with small Union Size.

On visible surface generation by a priori tree structures

A new algorithm for solving the hidden surface (or line) problem is described, to more rapidly generate realistic images of 3-D scenes composed of polygons, and the development of theoretical foundations in the area are presented.