Sciweavers

885 search results - page 103 / 177
» Optimal Polygon Placement
Sort
View
COMPGEOM
2006
ACM
14 years 4 months ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote
SMI
2005
IEEE
156views Image Analysis» more  SMI 2005»
14 years 3 months ago
Visualization of Point-Based Surfaces with Locally Reconstructed Subdivision Surfaces
Point-based surfaces (i.e. surfaces represented by discrete point sets which are either directly obtained by current 3D acquisition devices or converted from other surface represe...
Tamy Boubekeur, Patrick Reuter, Christophe Schlick
DCOSS
2006
Springer
14 years 1 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...
CGF
2000
96views more  CGF 2000»
13 years 10 months ago
An interactive approach to point cloud triangulation
We present an interactive system for the generation of high quality triangle meshes that allows us to handle hybrid geometry (point clouds, polygons, ...) as input data. In order ...
Leif Kobbelt, Mario Botsch
VLDB
1994
ACM
114views Database» more  VLDB 1994»
14 years 2 months ago
Including Group-By in Query Optimization
In existing relational database systems, processing of group-by and computation of aggregate functions are always postponed until all joins are performed. In this paper, we presen...
Surajit Chaudhuri, Kyuseok Shim