Sciweavers

1879 search results - page 122 / 376
» Computational geometry algorithms library
Sort
View
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
15 years 4 months ago
Voronoi diagram computations for planar NURBS curves
We present robust and efficient algorithms for computing Voronoi diagrams of planar freeform curves. Boundaries of the Voronoi diagram consist of portions of the bisector curves b...
Joon-Kyung Seong, Elaine Cohen, Gershon Elber
COMGEO
2006
ACM
15 years 4 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
COMPGEOM
2004
ACM
15 years 10 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
INFOCOM
2009
IEEE
15 years 11 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
VIS
2004
IEEE
214views Visualization» more  VIS 2004»
16 years 5 months ago
Surface Reconstruction of Noisy and Defective Data Sets
We present a novel surface reconstruction algorithm that can recover high-quality surfaces from noisy and defective data sets without any normal or orientation information. A set ...
Hui Xie, Kevin T. McDonnell, Hong Qin