skip to main content
research-article

Primitives for the manipulation of three-dimensional subdivisions

Published: 22 March 2023 Publication History

Abstract

Algorithms for manipulating three-dimensional cell complexes are seldom implemented due to the lack of a suitable data structure for representing them. Such a data structure is proposed here along with the primitive operations necessary to make it useful. Applications of the structure are also given.

References

[1]
Avis D. and Bhattacharya B. K. Preparata F. P. Algorithms for computingd-dimensional Voronoi diagrams and their duals Advances in Computing Research, vol. 1 1983 Greenwich, CT JAI Press 159-180
[2]
B. G. Baumgart, A polyhedron representation for computer vision, in1975 National Computer Conference, AFIPS Conference Proceedings, vol. 44, AFIPS Press, 1976, pp. 589–596.
[3]
B. K. Bhattacharya, Application of computational geometry to pattern recognition problems, Tech. Rep. 82-3, Simon Fraser University, 1982.
[4]
Braid I. C., Hillyard R. C., and Stroud I. A. Brodlie K. W. Stepwise construction of polyhedra in geometric modelling Mathematical Methods in Computer Graphics and Design 1980 London Academic Press 123-141
[5]
Brown K. Q. Voronoi diagrams from convex hulls Inform. Process. Lett. 1979 9 223-228
[6]
B. Chazelle and D. P. Dobkin, Detection is easier than computation,Proc. 12th ACM SIGACT Symposium, Los Angeles, May 1980, pp. 146–153.
[7]
Chand D. R. and Kapur S. S. An algorithm for convex polytopes J. Assoc. Comput. Mach. 1970 17 1 77-86
[8]
C. M. Eastman and K. Weiler, Geometric modeling using the Euler operators, Research Rep. 78, Institute of Physical Planning, Carnegie-Mellon University, February 1979.
[9]
Guibas L. and Stolfi J. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams ACM Trans. Graphics 1985 4 2 75-123
[10]
A. Jameson and T. Baker, Improvements to the aircraft Euler method, Paper AIAA-87-0452, AIAA 25th Aerospace Sciences Meeting, 1987.
[11]
M. J. Laszlo, A data structure for manipulating three-dimensional subdivisions, Dissertation, Department of Computer Science, Princeton University, August 1987.
[12]
B. W�rdenweber, Volume-triangulation, C.A.D. Group, University of Cambridge, 1980.

Cited By

View all
  • (2003)A scalable data structure for three-dimensional non-manifold objectsProceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing10.5555/882370.882380(72-82)Online publication date: 23-Jun-2003

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Algorithmica
Algorithmica  Volume 4, Issue 1-4
Jun 1989
590 pages

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 22 March 2023
Revision received: 14 March 1988
Received: 15 April 1987

Author Tags

  1. Three-dimensional cell complexes
  2. Data structures
  3. Computational geometry

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 19 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2003)A scalable data structure for three-dimensional non-manifold objectsProceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing10.5555/882370.882380(72-82)Online publication date: 23-Jun-2003

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media