150 search results - page 13 / 30 » Traversing a set of points with a minimum number of turns |
SAC
2008
ACM
13 years 7 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
SIROCCO
2007
13 years 9 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
CAD
2011
Springer
12 years 11 months ago
2011
Springer
Ridges are characteristic curves of a surface that mark salient intrinsic features of its shape and are therefore valuable for shape matching, surface quality control, visualizati...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
WSCG
2003
13 years 8 months ago
2003
In this paper we present the geometrical construction of an approximate generalized Voronoi diagram for generalized polygons and circular objects based on their minimum geometrica...