Sciweavers

EWC
2011
98views more  EWC 2011»
13 years 14 hour ago
Real-time triangulation of point streams
Hand-held laser scanners are commonly used in industry for reverse engineering and quality measurements. In this process, it is difficult for the human operator to scan the target...
Klaus Denker, Burkhard Lehner, Georg Umlauf
CORR
2011
Springer
164views Education» more  CORR 2011»
13 years 1 days ago
Irreducible triangulations of surfaces with boundary
A triangulation of a surface is irreducible if no edge can be contracted to produce a triangulation of the same surface. In this paper, we investigate irreducible triangulations o...
Alexandre Boulch, Éric Colin de Verdi&egrav...
JCO
2010
169views more  JCO 2010»
13 years 3 months ago
An almost four-approximation algorithm for maximum weight triangulation
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...
Shiyan Hu
IJFCS
2002
122views more  IJFCS 2002»
13 years 4 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers
GIS
2002
ACM
13 years 4 months ago
Characterisation and generalisation of cartographic lines using Delaunay triangulation
A method is presented for generalising cartographic lines using an approach based on determination of their structure. Constrained Delaunay triangulation is used to construct a ske...
P. M. van der Poorten, Christopher B. Jones
DCG
2000
55views more  DCG 2000»
13 years 4 months ago
Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.
Alexander Below, Jesús A. De Loera, Jü...
TCS
2008
13 years 5 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...
JAL
2006
114views more  JAL 2006»
13 years 5 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
CORR
2007
Springer
182views Education» more  CORR 2007»
13 years 5 months ago
Triangulating the Real Projective Plane
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...
Mridul Aanjaneya, Monique Teillaud
CGF
2007
126views more  CGF 2007»
13 years 5 months ago
A Lagrangian Approach to Dynamic Interfaces through Kinetic Triangulation of the Ambient Space
In this paper, we propose a robust and efficient Lagrangian approach for modeling dynamic interfaces between different materials undergoing large deformations and topology change...
Jean-Philippe Pons, Jean-Daniel Boissonnat