Sciweavers

5019 search results - page 9 / 1004
» On the Reflexivity of Point Sets
Sort
View
COMPGEOM
2004
ACM
14 years 24 days ago
Separating point sets in polygonal environments
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
SOFSEM
2007
Springer
14 years 1 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
DAM
2006
124views more  DAM 2006»
13 years 7 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris
JCT
2006
60views more  JCT 2006»
13 years 7 months ago
On the number of rectangulations of a planar point set
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
COCOA
2010
Springer
13 years 5 months ago
The Union of Colorful Simplices Spanned by a Colored Point Set
A simplex spanned by a colored point set in Euclidean d-space is colorful if all vertices have distinct colors. The union of all full-dimensional colorful simplices spanned by a c...
André Schulz, Csaba D. Tóth