Many-face complexity in incremental convex arrangements

DOI10.1016/0020-0190(94)00098-0MaRDI QIDQ1336754zbMATH OpenOpenAlexFDO

Authors Tamal K. Dey, N. R. Shah

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

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• Combinatorial complexity bounds for arrangements of curves and spheres
• Convex Decomposition of Polyhedra and Robustness
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Counting facets and incidences
• Cutting hyperplane arrangements
• On a problem of K. Zarankiewicz
• The complexity of many cells in arrangements of planes and related problems

This page was built for publication: Many-face complexity in incremental convex arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336754)