Non-manifold implicit surfaces based on discontinuous implicitization and polygonization

Proceedings - Geometric Modeling and Processing: Theory and Applications, GMP 2002

Volumn , Issue , 2002, Pages 138-146

  Yamazaki, S ^a,b   Kase, K ^a   Ikeuchi, K ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b RIKEN   (Japan)

Author keywords

implicit surface; implicitization; non manifold; polygonization; segmented distance; vertex generation diagram

Indexed keywords

IMPLICIT SURFACES; IMPLICITIZATION; NON-MANIFOLDS; POLYGONIZATION; SEGMENTED DISTANCE; VERTEX GENERATION DIAGRAM;

GEOMETRY;

EID: 84963831263     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GMAP.2002.1027505     Document Type: Conference Paper

References (21)

1. J. Bloomenthal. Polygonization of implicit surfaces. Computer Aided Geometric Design, 5:341-355, 1988.
2. J. Bloomenthal. Introduction to Implicit Surface. Morgan Kaufmann Publishers, Inc., 1997.
3. J. Bloomenthal and K. Ferguson. Polygonization of non-manifold implicit surfaces. Computer Graphics, 29:309-316, 1995.
4. G. Borgefors. Distance transformations in digital images. CVGIP, 34:344-371, 1986.
5. M. C., S. R., and S. R. A modified look-up table for implicit disambiguation of marching cubes. Visual Computer, 10(6):353-355, 1994.
6. H. Chen and S. Fang. Fast voxelization of three-dimensional synthetic objects. Journal of Graphics Tools, 3(4):33-45, 1998.
7. O. Cuisenaire and B. Macq. Fast and exact signed euclidean distance transformation with linear complexity. In ICASSP '99, volume 6, pages 3293-3296, 1999.
8. B. Curless and M. Levoy. A volumetric method for building complex models from range images. In SIGGRAPH '96, 1996.
9. P. E. Danielsson. Euclidean distance mapping. Computer Graphics and Image Processing, 14:227-248, 1980.
10. S. F. Frisken, R. N. Perry, A. P. Rockwood, and T. R. Jones. Adaptively sampled distance fields: A general representation of shape for computer graphics. In SIGGRAPH '00, 2000.
11. D. Gordon and J. Udupa. Fast surface tracking in 3d binary images. Computer Vision, Graphics and Image Processing, 1989.
12. H. C. Hege, M. Seebas, D. Stalling, and M. Zockler. A generalized marching cubes algorithm based on non-binary classifications. Technical report, Konrad-Zuse-Zentrum fur Informationstechnik (ZIB), 1997.
13. M. W. Jones and R. Satherley. Voxelisation: Modelling for volume graphics. In Vision, Modeling, and Visualisation 2000, pages 319-326, 2000.
14. D. H. Kim, U. Doering, and B. Bruderlin. Polygonization of non-manifolds with the aid of interval operators. In Implicit Surfaces '99, 2000.
15. L. Kobbelt, M. Botsch, U. Schwanecke, and H.-P. Seidel. Feature sensitive surface extraction from volume data. In SIGGRAPH '01, 2001.
16. W. Lorensen and H. Cline. Marching cubes: a high resolution 3d surface reconstruction algorithm. In SIGGRAPH '87, 1987.
17. N. G. M. and B. Hamann. The asymptotic decider: Resolving the ambiguity in marching cubes. In Visualization '91, pages 83-91, 1991.
18. A. P. Mangan and R. T. Whitaker. Partitioning 3d surface meshes using watershed segmentation. IEEE Transactions on Visualization and Computer Graphics, 5(4), 1999.
19. C. Montani, R. Scateni, and R. Scopigno. Discretized marching cubes. In Visualization '94, pages 281-287, 1994.
20. A. Rosenfeld and J. L. Pfaltz. Distance functions on digital pictures. Pattern Recognition, 1(1):33-61, 1968.
21. B. T. Stander and J. C. Hart. Guaranteeing the topology of an implicit surface polygonization for interactive modeling. In SIGGRAPH '97, 1997.