The complexity of the outer face in arrangements of random segments

DOI10.1145/1377676.1377689MaRDI QIDQ3602903zbMATH OpenOpenAlexFDO

Authors Noga Alon, Oren Nechushtan, Dan Halperin, Micha Sharir

Publication date 12 February 2009

Published in Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1377676.1377689

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Recommendations

• The complexity and construction of many faces in arrangements of lines and of segments
• Computing a Face in an Arrangement of Line Segments and Related Problems
• The number of edges of many faces in a line segment arrangement
• Arrangements of segments that share endpoints: Single face results
• Computing Many Faces in Arrangements of Lines and Segments

Cited in

(2)

• ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
• Thresholds for vanishing of `isolated' faces in random Čech and Vietoris-Rips complexes

Describes a project that uses

Uses Software

• 2D Arrangement

This page was built for publication: The complexity of the outer face in arrangements of random segments

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