Sciweavers

680 search results - page 68 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
DGCI
2008
Springer
13 years 9 months ago
Segmenting Simplified Surface Skeletons
A novel method for segmenting simplified skeletons of 3D shapes is presented. The so-called simplified Y-network is computed, defining boundaries between 2D sheets of the simplifie...
Dennie Reniers, Alexandru Telea
OSS
2009
Springer
14 years 2 months ago
Estimating Commit Sizes Efficiently
The quantitative analysis of software projects can provide insights that let us better understand open source and other software development projects. An important variable used in...
Philipp Hofmann, Dirk Riehle
GLOBECOM
2006
IEEE
14 years 2 months ago
Sensor Localization from WLS Optimization with Closed-form Gradient and Hessian
— A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The techniq...
Giuseppe Destino, Giuseppe Thadeu Freitas de Abreu
COMPGEOM
2003
ACM
14 years 1 months ago
Restricted delaunay triangulations and normal cycle
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive a definition of the curvature tensor for polyhed...
David Cohen-Steiner, Jean-Marie Morvan
CAGD
2000
61views more  CAGD 2000»
13 years 7 months ago
Efficient evaluation of triangular B-spline surfaces
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
Michael Franssen, Remco C. Veltkamp, Wieger Wessel...