Reverse search for enumeration, Discrete Applied Mathematics, vol.65, issue.1-3, pp.21-46, 1996. ,
DOI : 10.1016/0166-218X(95)00026-N
URL : http://doi.org/10.1016/0166-218x(95)00026-n
Mesh generation and optimal triangulation ,
An efficient algorithm for enumeration of triangulations, Presented at 10th Annual Fall Workshop on Computational Geometry, 2000. ,
Toplogical methods in combinatorics, Handbook of Combinatorics, pp.1819-1872, 1995. ,
Oriented matroids, 1992. ,
DOI : 10.1017/CBO9780511586507
The Number of Geometric Bistellar Neighbors of a Triangulation, Discrete & Computational Geometry, vol.21, issue.1, pp.131-142, 1999. ,
DOI : 10.1007/PL00009405
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms, ACM Transactions on Graphics, vol.9, issue.1, pp.66-104, 1990. ,
DOI : 10.1145/77635.77639
Visibility Complexes and the Baues Problem for Triangulations in the Plane, Discrete & Computational Geometry, vol.20, issue.1, pp.35-59, 1998. ,
DOI : 10.1007/PL00009377
Graph of triangulations of a convex polygon and tree of triangulations, Computational Geometry, vol.13, issue.3, pp.179-188, 1999. ,
DOI : 10.1016/S0925-7721(99)00016-4
Three-dimensional triangulations from local transformations, SIAM J. Sci. Stat. Comput, vol.10, pp.718-741, 1989. ,
Software for C 1 -interpolation, Mathematical Software III, 1977. ,
Projections of polytopes and the generalized baues conjecture, Discrete & Computational Geometry, vol.10, issue.230, pp.215-237, 1996. ,
DOI : 10.1007/BF02711510
Triangulations with very few geometric bistellar neighbors, Discrete Comput. Geom, vol.23, issue.1, pp.15-33, 2000. ,
Preserving order in a forest in less than logarithmic time and linear space, Information Processing Letters, vol.6, issue.3, pp.80-82, 1977. ,
DOI : 10.1016/0020-0190(77)90031-X
Lectures on Polytopes, 1994. ,