Arrangements of segments that share endpoints: Single face results

DOI10.1007/BF02574043zbMath0826.68063OpenAlexW1996965968MaRDI QIDQ1892408

Joseph S. B. Mitchell, Klara Kedem, Dan Halperin, N. Naor, Esther M. Arkin

Publication date: 2 July 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131361

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Arrangements of segments that share endpoints: Single face results ⋮ Drawing graphs using a small number of obstacles ⋮ Graphs with Large Obstacle Numbers ⋮ A Computational Geometric Approach to Visual Hulls

Cites Work

• Unnamed Item
• The complexity and construction of many faces in arrangements of lines and of segments
• An optimal algorithm for the boundary of a cell in a union of rays
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Separating two simple polygons by a sequence of translations
• Arrangements of segments that share endpoints: Single face results

This page was built for publication: Arrangements of segments that share endpoints: Single face results