Sciweavers

4245 search results - page 510 / 849
» Input Modeling
Sort
View
SIGGRAPH
1995
ACM
15 years 10 months ago
Automatic reconstruction of surfaces and scalar fields from 3D scans
We present an efficient and uniform approach for the automatic reconstruction of surfaces of CAD (computer aided design) models and scalar fields defined on them, from an unorg...
Chandrajit L. Bajaj, Fausto Bernardini, Guoliang X...
ECCV
2000
Springer
16 years 8 months ago
Colour by Correlation in a Three-Dimensional Colour Space
We improve the promising Colour by Correlation method for computational colour constancy by modifying it to work in a three dimensional colour space. The previous version of the al...
Kobus Barnard, Lindsay Martin, Brian V. Funt
FOCS
2009
IEEE
16 years 1 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
ISAAC
2009
Springer
140views Algorithms» more  ISAAC 2009»
16 years 1 months ago
Shifting Strategy for Geometric Graphs without Geometry
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
Imran A. Pirwani
STACS
2007
Springer
16 years 25 days ago
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Artur Czumaj, Christian Sohler