TRIANGULATING DISJOINT JORDAN CHAINS

DOI10.1142/S0218195994000252MaRDI QIDQ4327391zbMATH OpenOpenAlexFDO

Authors Reuven Bar-Yehuda, Bernard Chazelle

Publication date 6 April 1995

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195994000252

zbMATH Keywords

polygon triangulationJordan polygonal chains

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Triangulating Simple Polygons and Equivalent Problems
• Polygon triangulation: Efficiency and minimality
• A randomized algorithm for triangulating a simple polygon in linear time
• Polygon triangulation in \(O(n\log{}\log{}n)\) time with simple data structures
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

Cited in

(24)

• Sorting jordan sequences in linear time using level-linked search trees
• Finding a Rectilinear Shortest Path in R 2 Using Corridor Based Staircase Structures
• scientific article; zbMATH DE number 7559259 (Why is no real title available?)
• Routing among convex polygonal obstacles in the plane
• Routing in polygonal domains
• Visibility queries in a polygonal region
• Routing in polygonal domains
• scientific article; zbMATH DE number 5079472 (Why is no real title available?)
• Computing \(L_1\) shortest paths among polygonal obstacles in the plane
• Visibility and ray shooting queries in polygonal domains
• Bicriteria rectilinear shortest paths among rectilinear obstacles in the plane
• Quickest visibility queries in polygonal domains
• Separation and approximation of polyhedral objects
• Computing hereditary convex structures
• Three problems about simple polygons
• Routing among convex polygonal obstacles in the plane
• OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS
• A local triangulation algorithm to determine the relation between monotone chains
• Shortcut hulls: vertex-restricted outer simplifications of polygons
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
• Planar rectilinear shortest path computation using corridors
• Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
• Computing homotopic shortest paths efficiently
• Computing the \(L_1\) geodesic diameter and center of a polygonal domain

This page was built for publication: TRIANGULATING DISJOINT JORDAN CHAINS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327391)