Sciweavers

39 search results - page 4 / 8
» Distinct Triangle Areas in a Planar Point Set
Sort
View
CCCG
2004
13 years 9 months ago
On computing enclosing isosceles triangles and related problems
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
Prosenjit Bose, Carlos Seara, Saurabh Sethia
SODA
1992
ACM
109views Algorithms» more  SODA 1992»
13 years 9 months ago
New Algorithms for Minimum Area k-gons
Given a set P of n points in the plane, we wish to find a set Q P of k points for which the convex hull conv(Q) has the minimum area. We solve this, and the related problem of fi...
David Eppstein
CORR
2011
Springer
157views Education» more  CORR 2011»
12 years 11 months ago
Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing
Motivated by the desire to cope with data imprecision [8], we study methods for preprocessing a set of planar regions such that whenever we are given a set of points, each of whic...
Esther Ezra, Wolfgang Mulzer
CCCG
2010
13 years 9 months ago
Ghost chimneys
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...
David Charlton, Erik D. Demaine, Martin L. Demaine...
SSD
1995
Springer
84views Database» more  SSD 1995»
13 years 11 months ago
Lossless Representation of Topological Spatial Data
We present a data structure used to represent planar spatial databases in the topological data model. Conceptually, such databases consist of points, lines between these points, an...
Bart Kuijpers, Jan Paredaens, Jan Van den Bussche