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

Jerzy W. Jaromczyk, Grzegorz Świştek

Research output: Contribution to journalArticlepeer-review

Abstract

This paper studies an impact of geometric degeneracies on the complexity of geometric objects which are unions and intersections of open regions. We demonstrate a technique, based on the concept of lower semicontinuous functions, for proving that the maximum complexity is achieved on nondegenerate configurations of regions. We discuss in this context the complexity of stabbing regions, and arrangements of Jordan curves.

Original languageEnglish
Pages (from-to)174-183
Number of pages10
JournalJournal of Complexity
Volume7
Issue number2
DOIs
StatePublished - Jun 1991

Bibliographical note

Copyright:
Copyright 2014 Elsevier B.V., All rights reserved.

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Statistics and Probability
  • Numerical Analysis
  • General Mathematics
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A role of lower semicontinuous functions in the combinatorial complexity of geometric problems'. Together they form a unique fingerprint.

Cite this