Sciweavers

18155 search results - page 80 / 3631
» Point
Sort
View
IPCO
2007
114views Optimization» more  IPCO 2007»
15 years 3 months ago
Distinct Triangle Areas in a Planar Point Set
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
Adrian Dumitrescu, Csaba D. Tóth
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
15 years 3 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
SODA
2007
ACM
76views Algorithms» more  SODA 2007»
15 years 3 months ago
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
Manuel Bodirsky, Éric Fusy, Mihyun Kang, St...
77
Voted
DAGSTUHL
2006
15 years 3 months ago
Reference Point Approaches and Objective Ranking
The paper presents a reflection on some of the basic assumptions and philosophy of reference point approaches, stressing their unique concentration on the sovereignty of the subje...
Andrzej P. Wierzbicki
SODA
2001
ACM
108views Algorithms» more  SODA 2001»
15 years 3 months ago
Entropy-preserving cuttings and space-efficient planar point location
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
Sunil Arya, Theocharis Malamatos, David M. Mount