56 search results - page 4 / 12 » Distance-Sensitive Planar Point Location |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
— This paper addresses the problem of selecting contact locations for grasping objects in the presence of shape and contact location uncertainty. Focusing on two-dimensional plan...
GD
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
SODA
1997
ACM
13 years 10 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
DAM
2011
13 years 3 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...