Results 1  10
of
146
Tight lower bounds for minimum weight triangulation heuristics
 Information Processing Letters
, 1996
"... The minimum spanning tree heuristic is obtained by optimally triangulating a subgraph of the Delaunay triangulation, whereas the greedy spanning tree heuristic is obtained by optimally triangulating a subgraph of the greedy triangulation. In this paper it is shown that these two known heuristics can ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The minimum spanning tree heuristic is obtained by optimally triangulating a subgraph of the Delaunay triangulation, whereas the greedy spanning tree heuristic is obtained by optimally triangulating a subgraph of the greedy triangulation. In this paper it is shown that these two known heuristics
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 631 (6 self)
 Add to MetaCart
In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which
Mesh Generation And Optimal Triangulation
, 1992
"... We survey the computational geometry relevant to finite element mesh generation. We especially focus on optimal triangulations of geometric domains in two and threedimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some cri ..."
Abstract

Cited by 214 (7 self)
 Add to MetaCart
criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimization of triangulations on a fixed set of vertices and for the placement of new vertices (Steiner points). We briefly survey the heuristic algorithms used in some practical mesh generators.
Heuristic Algorithms for the Triangulation of Graphs
, 1995
"... Different uncertainty propagation algorithms in graphical structures can be viewed as a particular case of propagation in a joint tree, which can be obtained from different triangulations of the original graph. The complexity of the resulting propagation algorithms depends on the size of the resu lt ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
lting triangulated graph. The prob lem of obtaining an optimum graph triangu lation is known to be NPcomplete. Thus approximate algorithms which find a good triangulation in reasonable time are of particular interest. This work describes and compares several heuristic algorithms developed
Triangulating Simple Polygons: PseudoTriangulations
, 1988
"... Triangulating a given nvertex simple polygon means to partition the interior of the polygon into n − 2 triangles by adding n − 3 nonintersecting diagonals. Significant theoretical advances have recently been made in finding efficient polygon triangulation algorithms. However, there is substantial ..."
Abstract
 Add to MetaCart
diameter of the triangulationflipgraph is Θ(n2). (3) We prove the SpinNumber Theorem on simple polygons; an interesting topological result. (4) We propose a triangulation heuristic that uses the angular (deficit) indices, and the chordflip operation, in a local search to transform an initial pseudotriangulation
The Minimum Degree Heuristic and the Minimal Triangulation Process
 IN LECTURE NOTES IN COMPUTER SCIENCE
, 2003
"... The Minimum Degree Algorithm, one of the classical algorithms of sparse matrix computations, is a heuristic for computing a minimum triangulation of a graph. It is widely used as a component in every sparse matrix package, and it is known to produce triangulations with few fill edges in practice, al ..."
Abstract

Cited by 26 (8 self)
 Add to MetaCart
The Minimum Degree Algorithm, one of the classical algorithms of sparse matrix computations, is a heuristic for computing a minimum triangulation of a graph. It is widely used as a component in every sparse matrix package, and it is known to produce triangulations with few fill edges in practice
A Fast Heuristic For Finding The Minimum Weight Triangulation
, 1997
"... No polynomial time algorithm is known to compute the minimum weight triangulation (MWT) of a point set. In this thesis we present an efficient implementation of the LMTskeleton heuristic. This heuristic computes a subgraph of the MWT of a point set from which the MWT can usually be completed. For u ..."
Abstract
 Add to MetaCart
No polynomial time algorithm is known to compute the minimum weight triangulation (MWT) of a point set. In this thesis we present an efficient implementation of the LMTskeleton heuristic. This heuristic computes a subgraph of the MWT of a point set from which the MWT can usually be completed
Combinatories and Triangulations *
"... Abstract. The problem searching for an optimal triangulation with required properties (in a plane) is solved in this paper. Existing approaches are shortly introduced here and, specially, this paper is dedicated to the brute force methods. Several new brute force methods that solve the problem from ..."
Abstract
 Add to MetaCart
. Therefore, it can serve as a generator of optimal triangulations. For example, those results can be used in verification of developed heuristic methods or in other problems where accurate results are needed and no methods for required criterion have been developed yet. 1
Wellcentered triangulation
, 2010
"... Meshes composed of wellcentered simplices have nice orthogonal dual meshes (the dual Voronoi diagram). This is useful for certain numerical algorithms that prefer such primaldual mesh pairs. We prove that wellcentered meshes also have optimality properties and relationships to Delaunay and minm ..."
Abstract

Cited by 26 (7 self)
 Add to MetaCart
and minmax angle triangulations. We present an iterative algorithm that seeks to transform a given triangulation in two or three dimensions into a wellcentered one by minimizing a cost function and moving the interior vertices while keeping the mesh connectivity and boundary vertices fixed. The cost
Results 1  10
of
146