Sciweavers

31 search results - page 1 / 7
» Piecewise Linear Approximation of Signed Distance Fields
Sort
View
VMV
2003
154views Visualization» more  VMV 2003»
13 years 6 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
VMV
2007
155views Visualization» more  VMV 2007»
13 years 5 months ago
Accurate Computation of Geodesic Distance Fields for Polygonal Curves on Triangle Meshes
We present an algorithm for the efficient and accurate computation of geodesic distance fields on triangle meshes. We generalize the algorithm originally proposed by Surazhsky e...
David Bommes, Leif Kobbelt
SI3D
2006
ACM
13 years 10 months ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
CGF
2010
157views more  CGF 2010»
13 years 2 months ago
Non-iterative Second-order Approximation of Signed Distance Functions for Any Isosurface Representation
Signed distance functions (SDF) to explicit or implicit surface representations are intensively used in various computer graphics and visualization algorithms. Among others, they ...
Vladimir Molchanov, Paul Rosenthal, Lars Linsen
BIOINFORMATICS
2011
12 years 11 months ago
Algorithms for sorting unsigned linear genomes by the DCJ operations
Motivation: The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both ...
Haitao Jiang, Binhai Zhu, Daming Zhu