Problems and Results on Geometric Patterns

Peter Brass and János Pach

Chapter Chapter 2 in Graph Theory and Combinatorial Optimization, 2005, pp 17-36 from Springer

Abstract: Abstract Many interesting problems in combinatorial and computational geometry can be reformulated as questions about occurrences of certain patterns in finite point sets. We illustrate this framework by a few typical results and list a number of unsolved problems.

Keywords: Unit Distance; Point Pair; Geometric Pattern; Algorithmic Problem; Similar Copy (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-25592-7_2

Ordering information: This item can be ordered from
http://www.springer.com/9780387255927

DOI: 10.1007/0-387-25592-3_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().