Sciweavers

2980 search results - page 213 / 596
» Computational Geometry
Sort
View
154
Voted
ICRA
2010
IEEE
132views Robotics» more  ICRA 2010»
15 years 2 months ago
Sampling-based motion planning with temporal goals
Abstract— This paper presents a geometry-based, multilayered synergistic approach to solve motion planning problems for mobile robots involving temporal goals. The temporal goals...
Amit Bhatia, Lydia E. Kavraki, Moshe Y. Vardi
163
Voted
CGF
2011
14 years 7 months ago
Walking On Broken Mesh: Defect-Tolerant Geodesic Distances and Parameterizations
Efficient methods to compute intrinsic distances and geodesic paths have been presented for various types of surface representations, most importantly polygon meshes. These meshe...
Marcel Campen, Leif Kobbelt
132
Voted
ICCV
2001
IEEE
16 years 5 months ago
A Novel Modeling Algorithm for Shape Recovery of Unknown Topology
This paper presents a novel modeling algorithm that is capable of simultaneously recovering correct shape geometry as well as its unknown topology from arbitrarily complicated dat...
Ye Duan, Hong Qin
143
Voted
ACMACE
2005
ACM
15 years 9 months ago
D4MD: deformation system for a vehicle simulation game
This paper presents a hybrid geometrical-physical, plastic deformation technique applicable for solids, in the context of a car simulation game. This technique doesn’t aim to be...
Tiago Rodrigues, Rui Pires, José Miguel Sal...
ESA
2001
Springer
97views Algorithms» more  ESA 2001»
15 years 8 months ago
Splitting a Delaunay Triangulation in Linear Time
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...
Bernard Chazelle, Olivier Devillers, Ferran Hurtad...