AbstractWe consider the problem of enumerating triangulations of n points in the plane in general position. We introduce a tree of triangulations and present an algorithm for enumerating triangulations in O(loglogn) time per triangulation. It improves the previous bound by almost linear factor
AbstractA “rooted” plane triangulation is a plane triangulation with one designated vertex on the ou...
Given a set of n points S in the plane, a triangulation T of S is a maximal set of non-crossing segm...
We present a simple dynamic programming based method for counting straight-edge triangulations of pl...
AbstractWe consider the problem of enumerating triangulations of n points in the plane in general po...
AbstractRecently, Aichholzer introduced the remarkable concept of the so-called triangulation path (...
AbstractRecently, Aichholzer introduced the remarkable concept of the so-called triangulation path (...
Recently, Aichholzer introduced the remarkable concept of the so-called triangulation path (of a tri...
AbstractIn this paper, we present algorithms for enumerating, without repetitions, all triangulation...
In the pursuit of realistic terrain models, Gudmundsson, Hammar, and van Kreveld introduced higher-o...
A triangulation of a finite set S of points in R2 is a maximal set of line segments with disjoint in...
A triangulation of a finite set S of points in R2 is a maximal set of line segments with disjoint in...
AbstractIn this paper, we present algorithms for enumerating, without repetitions, all triangulation...
We present algorithms that given a straight edge triangulation of n points in the plane encode a tri...
AbstractWe show that the number of straight-edge triangulations exhibited by any set of n points in ...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
AbstractA “rooted” plane triangulation is a plane triangulation with one designated vertex on the ou...
Given a set of n points S in the plane, a triangulation T of S is a maximal set of non-crossing segm...
We present a simple dynamic programming based method for counting straight-edge triangulations of pl...
AbstractWe consider the problem of enumerating triangulations of n points in the plane in general po...
AbstractRecently, Aichholzer introduced the remarkable concept of the so-called triangulation path (...
AbstractRecently, Aichholzer introduced the remarkable concept of the so-called triangulation path (...
Recently, Aichholzer introduced the remarkable concept of the so-called triangulation path (of a tri...
AbstractIn this paper, we present algorithms for enumerating, without repetitions, all triangulation...
In the pursuit of realistic terrain models, Gudmundsson, Hammar, and van Kreveld introduced higher-o...
A triangulation of a finite set S of points in R2 is a maximal set of line segments with disjoint in...
A triangulation of a finite set S of points in R2 is a maximal set of line segments with disjoint in...
AbstractIn this paper, we present algorithms for enumerating, without repetitions, all triangulation...
We present algorithms that given a straight edge triangulation of n points in the plane encode a tri...
AbstractWe show that the number of straight-edge triangulations exhibited by any set of n points in ...
A triangulation of a finite point set A in IR d is a geometric simplicial complex which covers the c...
AbstractA “rooted” plane triangulation is a plane triangulation with one designated vertex on the ou...
Given a set of n points S in the plane, a triangulation T of S is a maximal set of non-crossing segm...
We present a simple dynamic programming based method for counting straight-edge triangulations of pl...
DOI
Add to ORKG