A role of lower semicontinuous functions in the combinatorial complexity of geometric problems

DOI10.1016/0885-064X(91)90004-HzbMath0741.68097OpenAlexW2043641657MaRDI QIDQ1179028

Jerzy W. Jaromczyk, Grzegorz Świątek

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90004-h

zbMATH Keywords

arrangementscombinatorial complexitygeometric degeneracies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

A Tverberg-type result on multicolored simplices

Cites Work

• Unnamed Item
• A geometric consistency theorem for a symbolic perturbation scheme
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Stabbing line segments
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes

This page was built for publication: A role of lower semicontinuous functions in the combinatorial complexity of geometric problems