We introduce the unoriented Θ-maximum as a new criterion for describing the shape of a set of planar points. We present efficient algorithms for computing the unoriented Θ-maximum of a set of planar… (More)

A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic block) is a sequence… (More)

We prove that [n/2J vertex guards are always sufficient and sometimes necessary to guard the surface of an n-vertex polyhedral terrain. We also show that l(4n 4)/13J edge guards are sometimes… (More)

This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data structure representing… (More)

The paper “The Approximability of the Exemplar Breakpoint Distance Problem” [1], which appeared in AAIM 2006, contained several negative results and one positive result — a claimed O(log n)factor… (More)

Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impact Task Force.… (More)

Matching two geometric objects in two-dimensional (2D) and three-dimensional (3D) spaces is a central problem in computer vision, pattern recognition, and protein structure prediction. In particular,… (More)

Map labeling is an important problem in Geographical Information Systems (GIS). This problem is well studied in the area of cartography, especially using heuristics and logic programming [Y072,… (More)