99 search results - page 7 / 20 » On empty convex polygons in a planar point set |
CCCG
2008
15 years 1 months ago
2008
We present data structures for triangular emptiness and reporting queries for a planar point set, where the query triangle contains the origin. The data structures use near-linear...
WADS
1995
Springer
15 years 3 months ago
1995
Springer
We consider the problem of obtaining “nice” quadrangulations of planar sets of points. For many applications “nice” means that the quadrilaterals obtained are convex if po...
101
click to vote
CCCG
2003
15 years 29 days ago
2003
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
COMPGEOM
2004
ACM
15 years 5 months ago
2004
ACM
Given a set P of n points in convex position in the plane, we prove that there exists a point p ∈ P such that the number of distinct distances from p is at least (13n−6)/36 . ...
JCO
2010
14 years 10 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...