Sciweavers

1879 search results - page 185 / 376
» Computational geometry algorithms library
Sort
View
COMPGEOM
2003
ACM
15 years 10 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
ICRA
2008
IEEE
149views Robotics» more  ICRA 2008»
15 years 11 months ago
Target detection and position likelihood using an aerial image sensor
— Sensor-based control is an emerging challenge in UAV applications. It is essential in a sensing task to account for sensor measurement errors when computing a target position e...
Zu Whan Kim, Raja Sengupta
106
Voted
NIME
2004
Springer
93views Music» more  NIME 2004»
15 years 10 months ago
On the Choice of Mappings Based On Geometric Properties
The choice of mapping strategies to effectively map controller variables to sound synthesis algorithms is examined. Specifically, we look at continuous mappings that have a geom...
Doug Van Nort, Marcelo M. Wanderley, Philippe Depa...
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 4 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
245
Voted
POPL
2008
ACM
16 years 5 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson