Advertisement

Volumes from overlaying 3-D triangulations in parallel

  • Wm. Randolph Franklin
  • Mohan S. Kankanhalli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 692)

Abstract

Consider a polyhedron that is triangulated into tetrahedra in two different ways. This paper presents an algorithm, and hints for implementation, for finding the volumes of the intersections of all overlapping pairs of tetrahedra. The algorithm should parallelize easily, based on our experience with similar algorithms. One application for this is, when given data in terms of one triangulation, to approximate it in terms of the other triangulation. One part of this algorithm is useful by itself. That is to locate a large number of points in a triangulation, by finding which tetrahedron contains each point.

Keywords

tetrahedron triangulation overlay uniform grid finite element model mass property uniform grid parallel point location 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCC92]
    P. Bresnahan, E. Corwin, and D. Cowen, editors. Proceedings of the Fifth International Symposium on Spatial Data Handling International Geographical Union, Commission on GIS, 3–7 August 1992. ISBN 0-9633532-2-5.Google Scholar
  2. [BK90]
    Kurt Brassel and H. Kishimoto, editors. 4th International Symposium on Spatial Data Handling, Zürich, 23–27 July 1990.Google Scholar
  3. [EM90]
    H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graphics, 9(1):66–104, January 1990.Google Scholar
  4. [ES92]
    Max Egenhofer and J. Sharma. Topological consistency. In Bresnahan et al. [BCC92], pages 335–343. ISBN 0-9633532-2-5.Google Scholar
  5. [FK90]
    Wm Randolph Franklin and Mohan Kankanhalli. Parallel object-space hidden surface removal. In Proceedings of SIGGRAPH'90 (Dallas, Texas) in Computer Graphics, volume 24, August 1990.Google Scholar
  6. [FKN89]
    Wm Randolph Franklin, Mohan Kankanhalli, and Chandrasekhar Narayanaswami. Geometric computing and the uniform grid data technique. Computer Aided Design, 21(7):410–420, 1989.Google Scholar
  7. [FNK+89]
    Wm Randolph Franklin, Chandrasekhar Narayanaswami, Mohan Kankanhalli, David Sun, Meng-Chu Zhou, and Peter YF Wu. Uniform grids: A technique for intersection detection on serial and parallel machines. In Proceedings of Auto Carto 9: Ninth International Symposium on Computer-Assisted Cartography, pages 100–109, Baltimore, Maryland, 2–7 April 1989.Google Scholar
  8. [Fra90]
    Win Randolph Franklin. Calculating map overlay polygon' areas without explicitly calculating the polygons — implementation. In 4th International Symposium on Spatial Data Handling, pages 151–160, Zürich, 23–27 July 1990.Google Scholar
  9. [FS90]
    Wm Randolph Franklin and Venkatesh Sivaswami. OVERPROP — calculating areas of map overlay polygons without calculating the overlay. In Second National Conference on Geographic Information Systems, pages 1646–1654, Ottawa, 5–8 March 1990.Google Scholar
  10. [Hel90]
    Martin Heller. Triangulation algorithms for adaptive terrain modeling. In Brassel and Kishimoto [BK90], pages 163–174.Google Scholar
  11. [HH90]
    Sara Hopkins and Richard G. Healey. A parallel implementation of Franklin's uniform grid technique for line intersection detection on a large transputer array. In Brassel and Kishimoto [BK90], pages 95–104.Google Scholar
  12. [HHW92]
    Sara Hopkins, R.G. Healy, and T.C. Waugh. Algorithm scalability for line intersection detection in parallel polygon overlay. In Bresnahan et al. [BCC92], pages 210–218. ISBN 0-9633532-2-5.Google Scholar
  13. [Kan90]
    Mohan Kankanhalli. Techniques for Parallel Geometric Computations. PhD thesis, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, October 1990.Google Scholar
  14. [KV92]
    Menno-Jab Kraak and E. Verbree. Tetrahedrons and animated maps in 2d and 3d space. In Bresnahan et al. [BCC92], pages 63–71. ISBN 0-9633532-2-5.Google Scholar
  15. [Nar91]
    Chandrasekhar Narayanaswami. Parallel Processing for Geometric Applications. PhD thesis, Electrical, Computer, and Systems Engineering Dept., Rensselaer Polytechnic Institute, 1991. UMI no. 92-02201.Google Scholar
  16. [NF92a]
    C. Narayanaswami and W. R. Franklin. Boolean Combinations of Polygons in Parallel. In Proceedings of the 1992 International Conference on Parallel Processing, volume tbd, page tbd, August 1992.Google Scholar
  17. [NF92b]
    Chandrasekhar Narayanaswami and Wm Randolph Franklin. Determination of mass properties of polygonal CSG objects in parallel. International Journal on Computational Geometry and Applications, 1(4), 1992.Google Scholar
  18. [PIA78]
    Y. Perl, A. Itai, and H. Avni. Interpolation search — a log log n search. Comm. ACM, 21(7):550–553, July 1978.Google Scholar
  19. [Pig92]
    Simon Pigot. A topological model for a 3-d spatial information system. In Bresnahan et al. [BCC92], pages 344–360. ISBN 0-9633532-2-5.Google Scholar
  20. [Pul90]
    David Pullar. Comparative study of algorithms for reporting geometrical intersections. In Brassel and Kishimoto [BK90], pages 66–76.Google Scholar
  21. [Saa91]
    Alan Saalfeld. An application of algebraic topology to an overlay problem of analytical cartography. Cartography and Geographic Information Systems (formerly The American Cartographer), 18(1):23–36, 1991.Google Scholar
  22. [Siv90]
    Venkateshkumar Sivaswami. Point inclusion testing in polygons and point location in planar graphs using the uniform grid technique. Master's thesis, Rensselaer Polytechnic Institute, Electrical, Computer, and Systems Engineering Dept., May 1990.Google Scholar
  23. [Sun89]
    David Sun. Implementation of a fast map overlay system in c. Master's thesis, Rensselaer Polytechnic Institute, Electrical, Computer, and Systems Engineering Dept., May 1989.Google Scholar
  24. [vR91]
    Jan W. van Roessel. A new approach to plane-sweep overlay: Topological structuring and line-segment classification. Cartography and Geographic Information Systems (formerly The American Cartographer), 18(1):49–67, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Wm. Randolph Franklin
    • 1
  • Mohan S. Kankanhalli
    • 2
  1. 1.Electrical, Computer & Systems engineering DepartmentRensselær Polytechnic InstituteTroyUSA
  2. 2.Institute of Systems ScienceNational University of SingaporeKent RidgeSingapore

Personalised recommendations