Sciweavers

COMGEO
2006
ACM
13 years 11 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
15 years 6 days ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...