ACM Home Page
Please provide us with feedback. Feedback
Minimum strictly convex quadrangulations of convex polygons
Full text PdfPdf (1.55 MB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the thirteenth annual symposium on Computational geometry table of contents
Nice, France
Pages: 193 - 202  
Year of Publication: 1997
ISBN:0-89791-878-9
Authors
Matthias Müller-Hannemann  Technische Universität Berlin, Sekr. MA 6-1, Stnd. 17.Juni 136, 10623 Berlin, Germany
Karsten Weihe  Universität Konstanz, Fakultät für Mathematik and Informatik, Postfach 5560/D188, 78434 Konstanz, Germany
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 38,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/262839.262960
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
BE92
 
ELOSU92
H. Everett, W. I.anhart, M. Overmars, T. Shermer, and J. Urrutia. Strictly convex quadrilateralizations of polygons. In Proceedings Fourth Canadian Conference on Computational Geometry, page, s 77-83, 1992.
 
GJ79
 
Ho88
 
Joe95
B. Joe. Quadrilateral mesh generation in polygonal regions. Computer-Aided Design, 27:209-222, 1995.
Lub85
 
MMW95
 
NC88
T. Nishizeki and N. Chiba. Planar Graphs: Theory and Algorithms, volume 32 of Annals of Discrete Mathematics. North-Holland, 1988.
 
Sac82
J. R. Sack. An O(nlog n) algorithm for decomposing simple rectilinear polygons into convex quadrilaterals. In Proceedings 20th Conference on Communications, Control, and Computing, pages 64-74, 1982.
 
ST81
J. R. Sack and G. Toussaint. A linear-time algorithm for decomposing rectilinear star-shape# polygons into convex quadrilaterals. In Proceedings 19th Conference on Communications, Control, and Computing, pages 21-30, 198 I.
 
TA93
T. Tam and C. Armstrong. Finite element mesh control by integer programming. Int. J. Numer. Methods Eng., 36:2581- 2605, 1993.
 
Tou95


Collaborative Colleagues:
Matthias Müller-Hannemann: colleagues
Karsten Weihe: colleagues