Many-face complexity in incremental convex arrangements

DOI10.1016/0020-0190(94)00098-0zbMath0941.68776OpenAlexW2075529348MaRDI QIDQ1336754

Nimish R. Shah, Tamal Krishna Dey

Publication date: 26 February 1996

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00098-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• The complexity of many cells in arrangements of planes and related problems
• Combinatorial complexity bounds for arrangements of curves and spheres
• Cutting hyperplane arrangements
• Counting facets and incidences
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Convex Decomposition of Polyhedra and Robustness
• On a problem of K. Zarankiewicz