Arrangements of segments that share endpoints: single face results

Authors:
Esther M. Arkin;Dan Halperin;Klara Kedem;Joseph S. B. Mitchell;Nir Naor
Affiliations:
School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY;Department of Computer Science, School of Mathematical Sciences, Tel Aviv University;Department of Computer Science, School of Mathematical Sciences, Tel Aviv University;School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY;Department of Computer Science, School of Mathematical Sciences, Tel Aviv University
Venue:
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Year:
1991

Planar realizations of nonlinear Davenport-Schinzel sequences by segments

Discrete & Computational Geometry
Separating two simple polygons by a sequence of translations

Discrete & Computational Geometry
The complexity and construction of many faces in arrangements of lines and of segments

Discrete & Computational Geometry - Special issue on the complexity of arrangements
On the general motion-planning problem with two degrees of freedom

Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Minimum-link paths among obstacles in the plane

SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Computing a face in an arrangement of line segments

SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms

Hi-index	0.00