Sciweavers

102291 search results - page 268 / 20459
» Computability in Computational Geometry
Sort
View
JCC
2007
70views more  JCC 2007»
15 years 6 months ago
Self-organizing superimposition algorithm for conformational sampling
Abstract: A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the de...
Fangqiang Zhu, Dimitris K. Agrafiotis
TOG
2008
137views more  TOG 2008»
15 years 6 months ago
Efficient traversal of mesh edges using adjacency primitives
Processing of mesh edges lies at the core of many advanced realtime rendering techniques, ranging from shadow and silhouette computations, to motion blur and fur rendering. We pre...
Pedro V. Sander, Diego Nehab, Eden Chlamtac, Hugue...
CGF
2002
127views more  CGF 2002»
15 years 6 months ago
Angle-Analyzer: A Triangle-Quad Mesh Codec
We present Angle-Analyzer, a new single-rate compression algorithm for triangle-quad hybrid meshes. Using a carefully-designed geometry-driven mesh traversal and an efficient enco...
Haeyoung Lee, Pierre Alliez, Mathieu Desbrun
TOG
2002
127views more  TOG 2002»
15 years 6 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
DGCI
2008
Springer
15 years 8 months ago
On Watershed Cuts and Thinnings
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
« Prev « First page 268 / 20459 Last » Next »