ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Overlaying simply connected planar subdivisions in linear time
Full text PdfPdf (658 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the eleventh annual symposium on Computational geometry table of contents
Vancouver, British Columbia, Canada
Pages: 119 - 126  
Year of Publication: 1995
ISBN:0-89791-724-3
Authors
Ulrich Finke  FB 15, Informatik, Westfälische Wilhelms-Universität, Einsteinstr. 62, D-48149 Münster, Germany
Klaus H. Hinrichs  FB 15, Informatik, Westfälische Wilhelms-Universität, Einsteinstr. 62, D-48149 Münster, Germany
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 37,   Citation Count: 4
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/220279.220292
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
Chan 94
T. Chart: A simple trapezoid sweep algorithm for reporting red/blue segment intersections, 6th Canadian Conference on Computational Geometry (1994), 263 - 268.
 
Cha 91
Bernard Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, v.6 n.5, p.485-524, 1991
 
Fin 94
U. Finke: Algorithmen ~ Versctmeidungsoperationen, Ph.D. Thesis, University of Siegen, 1994.
GuSe 86
L Guibas , R Seidel, Computing convolutions by reciprocal search, Proceedings of the second annual symposium on Computational geometry, p.90-99, June 02-04, 1986, Yorktown Heights, New York, United States  [doi>10.1145/10515.10525]
GuSt 85
Leonidas Guibas , Jorge Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi, ACM Transactions on Graphics (TOG), v.4 n.2, p.74-123, April 1985  [doi>10.1145/282918.282923]
 
Sei 91
Raimund Seidel, A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons, Computational Geometry: Theory and Applications, v.1 n.1, p.51-64, July 1991  [doi>10.1016/S0925-7721(99)00042-5 ]
 
Wen 94
M. Wenzel: Verschneidungsoperationen f-rtr Geo-Informationsysteme, Diploma Thesis, University of Mttnster, 1994.

CITED BY  4
 
Chao-Hung Lin , Tong-Yee Lee, Metamorphosis of 3D Polyhedral Models Using Progressive Connectivity Transformations, IEEE Transactions on Visualization and Computer Graphics, v.11 n.1, p.2-12, January 2005
 
Pankaj K. Agarwal , Mark de Berg , Sariel Har-Peled , Mark H. Overmars , Micha Sharir , Jan Vahrenhold, Reporting intersecting pairs of convex polytopes in two and three dimensions, Computational Geometry: Theory and Applications, v.23 n.2, p.195-207, September 2002
 
Efi Fogel , Dan Halperin, Exact and efficient construction of Minkowski sums of convex polyhedra with applications, Computer-Aided Design, v.39 n.11, p.929-940, November, 2007
 
Tong-Yee Lee , Po-Hua Huang, Fast and Intuitive Metamorphosis of 3D Polyhedral Models Using SMCC Mesh Merging Scheme, IEEE Transactions on Visualization and Computer Graphics, v.9 n.1, p.85-98, January 2003

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Computations on discrete structures

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Graph algorithms


General Terms:
Algorithms, Theory

Collaborative Colleagues:
Ulrich Finke: colleagues
Klaus H. Hinrichs: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2008 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player