Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Package for Triangulations 3 T. Ono y , Y. Kyoda y , T. Masada y , K. Hayase y , T. Shibuya y , M. Inaba y , H. Imai y , K. Imai z and D. Avis x
 

Summary: A Package for Triangulations 3
T. Ono y , Y. Kyoda y , T. Masada y , K. Hayase y , T. Shibuya y , M. Inaba y , H. Imai y , K. Imai z and D. Avis x
1 Introduction
Triangulations of a point set have been intensively stud­
ied in computational geometry in these years. Triangu­
lations are very important not only from the viewpoint
of their applications to computer graphics, numerical
analysis but also from a fact that triangulations are yet
another fundamental structure in discrete geometry like
hyperplane arrangements.
Our group has developed many systems concerning
triangulations. Specifically,
ffl minimum weight triangulation of a planar point set
ffl enumerating all triangulations of a planar point set
ffl uniform generation of triangulations of a planar
point set
ffl enumeration of all regular triangulations of a point
set in general dimensions
In this video, we demonstrate our results of the above­
mentioned problems, mainly using animation.

  

Source: Avis, David - School of Computer Science, McGill University

 

Collections: Computer Technologies and Information Sciences