Sciweavers

1604 search results - page 199 / 321
» Approximation algorithms for developable surfaces
Sort
View
131
Voted
MFCS
2004
Springer
15 years 7 months ago
The Bidimensional Theory of Bounded-Genus Graphs
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitr...
CII
2006
141views more  CII 2006»
15 years 1 months ago
FPGA-based tool path computation: An application for shoe last machining on CNC lathes
Tool path generation is one of the most complex problems in Computer Aided Manufacturing. Although some efficient strategies have been developed, most of them are only useful for s...
Antonio Jimeno, José Luis Sánchez, H...
IVC
2008
205views more  IVC 2008»
15 years 1 months ago
A unified framework for scene illuminant estimation
Most illuminant estimation algorithms work with the assumption of one specific type of the light source (e.g. point light source or directional light source). This assumption brin...
Wei Zhou, Chandra Kambhamettu
SMA
2008
ACM
182views Solid Modeling» more  SMA 2008»
15 years 1 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
CDC
2008
IEEE
15 years 8 months ago
Simultaneous placement and assignment for exploration in mobile backbone networks
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
Emily M. Craparo, Jonathan P. How, Eytan Modiano