ACM DL

SIGN IN   SIGN UP

 
ACM Home Page ACM Digital Library Home Page

Spatial geometric constraint solving based on k-connected graph decomposition

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Gui-Fang Zhang Beijing Forestry University, Beijing, China
Xiao-Shan Gao Institute of Systems Science, Academia Sinica, Beijing, China
Published in:
Cover Image
 
· Proceeding
SAC '06 Proceedings of the 2006 ACM symposium on Applied computing
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-108-2 doi>10.1145/1141277.1141510
Spatial geometric constraint solving based on k-connected graph decomposition Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder