Guest Editors’ Foreword Farhad ShahrokhiLászló Székely EditorialNotes 01 November 2002 Pages: 447 - 448
The Unit Distance Problem for Centrally Symmetric Convex Polygons ÁbregoFernández-Merchant OriginalPaper 01 November 2002 Pages: 467 - 473
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces AronovSharir OriginalPaper 01 November 2002 Pages: 475 - 490
The Number of Directions Determined by Points in the Three-Dimensional Euclidean Space BlokhuisSeress OriginalPaper 01 November 2002 Pages: 491 - 494
Combinatorial Geometry Problems in Pattern Recognition Braß OriginalPaper 01 November 2002 Pages: 495 - 510
Topological Persistence and Simplification EdelsbrunnerLetscherZomorodian OriginalPaper 01 November 2002 Pages: 511 - 533
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping EfratGuibasMurali OriginalPaper 01 November 2002 Pages: 535 - 569
Restricted Point Configurations with Many Collinear {k}-Tuplets Ismailescu OriginalPaper 01 November 2002 Pages: 571 - 575
Gallai—Sylvester Theorem for Pairwise Intersecting Unit Circles Pinchasi OriginalPaper 01 November 2002 Pages: 607 - 624
The Partitioned Version of the Erdős—Szekeres Theorem PórValtr OriginalPaper 01 November 2002 Pages: 625 - 637
The k Most Frequent Distances in the Plane SolymosiTardosTóth OriginalPaper 01 November 2002 Pages: 639 - 648
Independence Numbers of Planar Contact Graphs Swanepoel OriginalPaper 01 November 2002 Pages: 649 - 670
A Sufficient Condition for the Existence of Large Empty Convex Polygons Valtr OriginalPaper 01 November 2002 Pages: 671 - 682
