List of combinatorial computational geometry topics

From Wikipedia, the free encyclopedia
Jump to: navigation, search

List of combinatorial computational geometry topics enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.

See List of numerical computational geometry topics for another flavor of computational geometry that deals with geometric objects as continuous entities and applies methods and algorithms of nature characteristic to numerical analysis.


Extremal shapes[edit]


Proximity problems[edit]