Rotating squares to boundary cubes: boundary representation and classification techniques for two- and three-dimensional objects

Authors:
Carsten Maple
Affiliations:
Department of Computing and Information Systems, University of Luton, Luton, Bedfordshire, LU1 3JU. United Kingdom
Venue:
Geometric modeling
Year:
2004

Citing 4
Cited 0

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Fast generation of molecular surfaces from 3D data fields with an enhanced “marching cube” algorithm

Journal of Computational Chemistry
POCKET: a computer graphics method for identifying and displaying protein cavities and their surrounding amino acids

Journal of Molecular Graphics
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this chapter we present algorithms for the representation and classification of the boundaries of two- and three-dimensional objects. The techniques covered are based on the Marching Cubes algorithm of Lorenson and Cline and differ from standard approximations such as those highlighted in Rosin as they do not involve any loss of data when using pixelised values.The techniques also permit a method for the charcterisation of objects by their boundaries; all that is required is the application of standard graph comparison algorithms on these modified data structures.