SIGN IN
SIGN UP
Happy endings for flip graphs
Full Text:
PDF
Buy this Article
Author:
David Eppstein
University of California - Irvine, Irvine, CA
Published in:
· Proceeding
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Pages 92-101
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-705-6
doi>
10.1145/1247069.1247084
2007 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 21
· Downloads (cumulative): 279
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SoCG '13
Share:
|
Tags:
algorithms
bistellar flip
empty pentagon
flip distance
flip graph
geometrical problems and computations
hypercube
isometric embedding
partial cube
triangulation
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder