Allowable Sequences and Order Types in Discrete and Computational Geometry

1993/01/01 by Jacob E. Goodman, Richard Pollack · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Artificial intelligence #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Conjecture #Discrete geometry #General position #Geometry #Mathematics #Matroid #Object (grammar) #Order (exchange) #Physics #Plane (geometry) #Position (finance) #Regular polygon #Sequence (biology) #Simplicity #graph theory and CDMA systems

paper · doi:10.1007/978-3-642-58043-7_6

crossref issued 1993/01/01 · crossref published 1993/01/01 · crossref published-print 1993/01/01 · openalex publication_date 1993/01/01 · crossref created 2011/09/16 · crossref deposited 2021/05/06 · openalex created_date 2025/10/10 · crossref indexed 2025/11/21 · openalex updated_date 2026/08/04

Citations

• Einige Gesetze über die Theilung der Ebene und des Raumes.
• The number of small semispaces of a finite set of points in the plane
• Numerical stability of algorithms for line arrangements
• Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic

Cited by

• Arrangement of lines [wikipedia]