Sciweavers

2093 search results - page 252 / 419
» Statistical Point Geometry
Sort
View
CGA
1999
15 years 2 months ago
Visualizing Large Telecommunication Data Sets
displays to abstract network data and let users interactwithit.Wehaveimplementedafull-scaleSwift3D prototype, which generated the examples we present here. Swift-3D We developed Sw...
Eleftherios Koutsofios, Stephen C. North, Daniel A...
132
Voted
ICCV
2001
IEEE
16 years 4 months ago
Beyond Lambert: Reconstructing Surfaces with Arbitrary BRDFs
W e address an open and hitherto neglected problem in computer vision, how to reconstruct the geometry of objects with arbitrary and possibly anisotropic bidirectional reflectance...
Sebastian Magda, David J. Kriegman, Todd Zickler, ...
STACS
2010
Springer
15 years 9 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
COMPGEOM
2006
ACM
15 years 8 months ago
A fast k-means implementation using coresets
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
Gereon Frahling, Christian Sohler
135
Voted
SMA
2003
ACM
132views Solid Modeling» more  SMA 2003»
15 years 7 months ago
Tight cocone: a water-tight surface reconstructor
Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algor...
Tamal K. Dey, Samrat Goswami