On disjoint concave chains in arrangements of (pseudo) lines

DOI10.1016/0020-0190(91)90076-TzbMath0748.68084OpenAlexW4231488810MaRDI QIDQ1183468

Micha Sharir, Dan Halperin

Publication date: 28 June 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90076-t

zbMATH Keywords

polygonal chainsarrangements of lines

Mathematics Subject Classification ID

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

Related Items (6)

Corrigendum to: ``On disjoint concave chains in arrangements of (pseudo) lines ⋮ Convex polygons made from few lines and convex decompositions of polyhedra ⋮ Erased arrangements of linear and convex decompositions of polyhedra ⋮ On the number of regular vertices of the union of Jordan regions ⋮ On the number of regular vertices of the union of Jordan regions ⋮ Robot motion planning and the single cell problem in arrangements

Cites Work

• Unnamed Item
• Lower bounds on the length of monotone paths in arrangements
• A deterministic view of random sampling and its use in geometry
• Construction of \(\epsilon\)-nets
• Combinatorial complexity bounds for arrangements of curves and spheres
• \(\epsilon\)-nets and simplex range queries
• Topologically sweeping an arrangement
• Applications of random sampling in computational geometry. II
• On extremal problems of graphs and generalized graphs

This page was built for publication: On disjoint concave chains in arrangements of (pseudo) lines