Overlaying simply connected planar subdivisions in linear time

Proceedings of the Annual Symposium on Computational Geometry

Volumn Part F129372, Issue , 1995, Pages 119-126

  Finke, Ulrich ^a   Hinrichs, Klaus H ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY;

LINEAR TIME; PLANAR SUBDIVISION;

MAMMALS;

EID: 84968399558     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/220279.220292     Document Type: Conference Paper

References (7)

1. T. Chan: A simple trapezoid sweep algorithm for reporting red/blue segment intersections, 6th Canadian Conference on Computational Geometry (1994), 263-268.
2. B. M. Chazelle: Triangulating a simple polygon in linear time, Discrete & Computational Geometry 6(1991), 485-524.
3. U. Finke: Algorithmen für Verschneidungsoperationen, Ph. D. Thesis, University of Siegen, 1994.
4. L. Guibas, R. Seidel: Computing convolutions by reciprocal search, 2nd ACM Symposium on Computational Geometry (1986), 90-99.
5. L. Guibas, J. Stolfi: Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, ACM Transactions on Graphics 4(1985), 74-123.
6. R. Seidel: A simple and fast incremental randomized algorithm for computing trape-zoidal decompositions and for traingulating polygons, Computational Geometry: Theory and Applications 1(1991), 51-64.
7. M. Wenzel: Verschneidungsoperationen für Geo-Informationsysterne, Diploma Thesis, University of Münster, 1994.