Sciweavers

7 search results - page 1 / 2
» Sampling Eulerian Orientations of the Triangle
Sort
View
107
Voted
ACID
2006
274views Algorithms» more  ACID 2006»
14 years 11 months ago
Sampling Eulerian Orientations of the Triangle
Páidí J. Creed
TVCG
2008
110views more  TVCG 2008»
14 years 9 months ago
Visibility-driven Mesh Analysis and Visualization through Graph Cuts
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
Kaichi Zhou, Eugene Zhang, Jirí Bittner, Pe...
CAD
2005
Springer
14 years 9 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
Chuan-Chu Kuo, Hong-Tzong Yau
PR
2008
132views more  PR 2008»
14 years 9 months ago
Measuring linearity of planar point sets
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
Milos Stojmenovic, Amiya Nayak, Jovisa D. Zunic