189 search results - page 18 / 38 » Graph-Theoretic Solutions to Computational Geometry Problems |
JCDCG
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
IMR
1998
Springer
13 years 11 months ago
1998
Springer
High reynolds number ow simulations exhibit strong gradients normal to walls and across shear layers requiring much ner resolution of the solution in some directions compared to o...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
SC
2004
ACM
14 years 28 days ago
2004
ACM
The solution of elliptic diffusion operators is the computational bottleneck in many simulations in a wide range of engineering and scientific disciplines. We present a truly sca...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...