Arrangements of curves in the plane — topology, combinatorics, and algorithms-Reference-Cited by-同舟云学术

Arrangements of curves in the plane — topology, combinatorics, and algorithms

Published:1988 Issue: Volume: Page:214-229
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Edelsbrunner Herbert,Guibas Leonidas,Pach Janos,Pollack Richard,Seidel Raimund,Sharir Micha

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-19488-6_118.pdf

Reference25 articles.

1. P. Agarwal, M. Sharir and P. Shor, Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences, Rep. 332, Comput. Sci. Dept., Courant Institute, New York, 1987.

2. B. Aronov and M. Sharir, Triangles in space, or: Building and analyzing castles in the air, Proc. 4th ACM Symp. on Computational Geometry, 1988.

3. M. Atallah, Some dynamic computational problems, Comp. Math. Appls. 11 (1985), pp. 1171–1181.

4. B. Chazelle and H. Edelsbrunner An optimal algorithm for intersecting line segments in the plane, Rep. UIUCDCS-R-88-1419, Dept. Comput. Sci., Univ. Illinois, Urbana, 1988.

5. B. Chazelle, L. Guibas and D.T. Lee, The power of geometric duality, BIT 25 (1985) pp. 76–90.

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the complexity of a single cell in certain arrangements of surfaces related to motion planning;Discrete & Computational Geometry;1994-01

2. On the Zone Theorem for Hyperplane Arrangements;SIAM Journal on Computing;1993-04

3. On the zone of a surface in a hyperplane arrangement;Discrete & Computational Geometry;1993-02

4. Geometric Algorithms;Handbook of Convex Geometry;1993

5. Convex Decomposition of Polyhedra and Robustness;SIAM Journal on Computing;1992-04