Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Computing Convex Quadrangulations6 T. Schiffer
 

Summary: Computing Convex Quadrangulations6
T. Schiffer
Institute of Computer Graphics and Knowledge Visualization
University of Technology
Graz, Austria
F. Aurenhammer
Institute for Theoretical Computer Science
University of Technology
Graz, Austria
M. Demuth
Institute for Theoretical Computer Science
University of Technology
Graz, Austria
Abstract
We use projected Delaunay tetrahedra and a maximum independent set ap-
proach to compute large subsets of convex quadrangulations on a given set of
points in the plane. The new method improves over the popular pairing method
based on triangulating the point set.
Key words: Irregular quadrilateral mesh, convex quadrangles, shape quality,
Delaunay tetrahedra, maximum independent set

  

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universitšt Graz

 

Collections: Computer Technologies and Information Sciences