Geometric design and space planning using the marching squares and marching cube algorithms

In the paper we present a method for area and volume approximation using modifications to the marching cubes algorithm of Lorensen and Cline (1987). Approximations to two and three-dimensional objects using marching squares and marching cubes have been covered extensively. Given an approximation to an object, an algorithm is presented which allows a simple method that can approximate the area or volume of the object. More interestingly the method can be used to estimate the area encapsulated between two points on the surface and a line or the volume encapsulated between three points on the surface and a plane. This is of use in room and space planning operations or the design of rooms and manufactured products.

[1]  Carsten Maple,et al.  Finding and characterising candidate binding sites , 2001, Proceedings Fifth International Conference on Information Visualisation.

[2]  Georges Voronoi.  Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Premier mémoire. Sur quelques propriétés des formes quadratiques positives parfaites. , 1908 .

[3]  Ammar Joukhadar,et al.  Solving complex motion planning problems by combining geometric and physical models: the cases of a rover and of a dextrous hand , 1995 .

[4]  Iosif I. Vaisman,et al.  Delaunay Tessellation of Proteins: Four Body Nearest-Neighbor Propensities of Amino Acid Residues , 1996, J. Comput. Biol..

[5]  Carsten Maple.  A boundary representation technique for three-dimensional objects , 2001, Proceedings Fifth International Conference on Information Visualisation.

[6]  Piero Procacci,et al.  A General Algorithm for Computing Voronoi Volumes - Application to the Hydrated Crystal of Myoglobin , 1992 .

[7]  P. Argos,et al.  Cavities and packing at protein interfaces , 1994, Protein science : a publication of the Protein Society.

[8]  M. Levitt,et al.  The volume of atoms on the protein surface: calculated from simulation, using Voronoi polyhedra. , 1995, Journal of molecular biology.

[9]  Doina Precup,et al.  Temporal abstraction in reinforcement learning , 2000, ICML 2000.

[10]  M Gerstein,et al.  Packing at the protein-water interface. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[11]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[12]  Roger D. Hersch,et al.  Parallel unfolding and visualization of curved surfaces extracted from large three-dimensional volumes , 2002, J. Electronic Imaging.

[13]  F M Richards,et al.  An analysis of packing in the protein folding problem , 1993, Quarterly Reviews of Biophysics.