Triage polygonization of rounded polyhedra

Visual Computer

Volumn 15, Issue 1, 1999, Pages 36-54

  Wünsche, Burkhard ^a   Lobb, Richard ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; TREES (MATHEMATICS);

BINARY SPACE PARTITIONING (BSP) TREES; TRIAGE POLYGONIZATION;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 0344183064     PISSN: 01782789     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003710050161     Document Type: Article

References (21)

1. Bloomenthal J (1988) Polygonization of implicit surfaces. Comput Aided Geom Des 5:341-355
2. Bloomenthal J (1994) An implicit surface polygonizaer. In: Heckbert PS (ed) Graphics Gems IV, Chap. 8. Academic Press, Cambridge
3. Colburn S (1990) Solid modeling with global blending for machining dies and patterns. Proceedings of the 41st Annual Earthmoving Industry Conference, SAE technical paper series, SAE International, Warrendale, Pa
4. Dansted PJ (1997) Convolutional smoothing of polyhedra. Masters's Thesis, Department of Computer Science, University of Auckland, Auckland, New Zealand
5. Doi A, Koide A (1991) An efficient method of triangulating equivalued surfaces by using tetrahedral cells. IEICE Trans Commun Elec Inf Syst E-74:214-224
6. Duff T (1992) Interval arithmetic and recursive subdivision for implicit functions and constructive solid geometry. SIGGRAPH Comput Graph 26:131-138
7. Fuchs H, Kedem Z, Naylor BF (1980) On visible surface generation by a priority tree structure. SIGGRAPH Comput Graph 14:124-133
8. Gieng TS, Hamann B, Joy KI, Schussman G, Trotts IJ (1998) Constructing hierarchies for triangle meshes. IEEE Trans Visualization Comput Graph 4:145-161
9. Hall M, Warren J (1990) Adaptive polygonization of implicitly defined surfaces. IEEE Comput Graph Appl 10:33-42
10. Hinker P, Hansen C (1993) Geometric optimization. Comput IEEE Proceedings of Visualization '93, pp 189-195
11. nd edition
12. Kalvin AD, Taylor RH (1996) Superfaces: polygonal mesh simplification with bounded error. IEEE Comput Graph Appl 16:64-77
13. Lobb R (1996) Quasiconvolutional smoothing of polyhedra. Visual Comput 12:373-389
14. Lorensen W, Cline H (1987) Marching cubes: a high resolution 3D surface construction algorithm. Comput Graph (SIGGRAPH'87 Proceedings), 21:163-169
15. Naylor BF (1981) A priori based techniques for determining visibility priority for 3D scenes. PhD Thesis, University of Texas, Dallas, Tex
16. Naylor BF, Amanatides J, Thibault W (1990) Merging BSP trees yields polyhdral set operations. SIGGRAPH Comput Graph 24:115-124
17. Snyder JM (1992) Interval analysis for computer graphics. SIGGRAPH Comput Graph 26:121-130
18. Thibault WC, Naylor BF (1987) Set operations on polyhedra using binary space partitioning trees. Comput Graph (SIGGRAPH'87 Proceedings), 2:153-162
19. Wyvill G, McPheeters C, Wyvill B (1986) Animating soft objects. Visual Comput 2:235-242
20. Wünsche BC (1996) A fast polygonization method for quasiconvolutionally smoothed polyhedra. Master's Thesis, Department of Computer Science, University of Auckland, Auckland, New Zealand
21. Wünsche BC (1997) A survey and analysis of common polygonization methods & optimization techniques. Mach Graph Vision 6:451-486