Open AccessProceedings Article
Complexity of cutting convex polytopes.
Bernard Chazelle,Herbert Edelsbrunner,Leonidas J. Guibas +2 more
- pp 66-76
Reads0
Chats0
About:
This article is published in Symposium on the Theory of Computing.The article was published on 1987-12-01 and is currently open access. It has received 4 citations till now. The article focuses on the topics: Polytope.read more
Citations
More filters
Journal ArticleDOI
Parallel transitive closure and point location in planar structures
TL;DR: Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar $st$-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs.
Journal ArticleDOI
Dynamic Maintenance of Planar Digraphs, with Applications
TL;DR: The discovered structural properties of planarst-graphs provide a unifying theoretical underpinning for several applications, such as dynamic point location in planar monotone subdivisions, dynamic transitive-closure query in planARst- graphs, and dynamic contact-chain query in convex subdivisions.
Proceedings ArticleDOI
Optimal parallel algorithms for transitive closure and point location in planar structures
TL;DR: This work presents parallel algorithms for several graph and geometric problems, including transitive closure and topological sorting in planar $st$-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs.
Book ChapterDOI
Irregularities of Distribution, Derandomization, and Complexity Theory
TL;DR: The study of discrepancy theory predates complexity theory and a wealth of mathematical techniques can be brought to bear to prove nontrivial derandomization results, which constitutes the discrepancy method.
References
More filters
Journal ArticleDOI
Parallel transitive closure and point location in planar structures
TL;DR: Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar $st$-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs.
Journal ArticleDOI
Dynamic Maintenance of Planar Digraphs, with Applications
TL;DR: The discovered structural properties of planarst-graphs provide a unifying theoretical underpinning for several applications, such as dynamic point location in planar monotone subdivisions, dynamic transitive-closure query in planARst- graphs, and dynamic contact-chain query in convex subdivisions.
Proceedings ArticleDOI
Optimal parallel algorithms for transitive closure and point location in planar structures
TL;DR: This work presents parallel algorithms for several graph and geometric problems, including transitive closure and topological sorting in planar $st$-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs.
Book ChapterDOI
Irregularities of Distribution, Derandomization, and Complexity Theory
TL;DR: The study of discrepancy theory predates complexity theory and a wealth of mathematical techniques can be brought to bear to prove nontrivial derandomization results, which constitutes the discrepancy method.