Sciweavers

1245 search results - page 164 / 249
» Triangulation for Points on Lines
Sort
View
IMR
2003
Springer
15 years 3 months ago
A Mesh Warping Algorithm Based on Weighted Laplacian Smoothing
We present a new mesh warping algorithm for tetrahedral meshes based upon weighted laplacian smoothing. We start with a 3D domain which is bounded by a triangulated surface mesh a...
Suzanne M. Shontz, Stephen A. Vavasis
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 2 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
SGP
2007
15 years 7 days ago
Shape reconstruction from unorganized cross-sections
In this paper, we consider the problem of reconstructing a shape from unorganized cross-sections. The main motivation for this problem comes from medical imaging applications wher...
Jean-Daniel Boissonnat, Pooran Memari
EJC
2010
14 years 10 months ago
On the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
Robert Connelly, Jean-Marc Schlenker
EM
2010
155views Management» more  EM 2010»
14 years 10 months ago
Hyperbolic Graphs of Small Complexity
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
Damian Heard, Craig Hodgson, Bruno Martelli, Carlo...