SIGN IN
SIGN UP
The number of lines tangent to arbitrary convex polyhedra in 3D
Full Text:
PDF
Buy this Article
Authors:
H. Brönnimann
Polytechnic University, NY
O. Devillers
INRIA Sophia-Antipolis, Sophia-Antipolis, France
V. Dujmović
McGill University, Montreal, Canada
H. Everett
LORIA, Nancy, France
M. Glisse
LORIA, Nancy, France
X. Goaoc
LORIA, Nancy, France
S. Lazard
LORIA - INRIA Lorraine, Nancy, France
H.-S. Na
Soongsil University, Seoul, S. Korea
S. Whitesides
McGill University, Montreal, Canada
2004 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 15
· Downloads (cumulative): 244
· Citation Count: 0
Published in:
· Proceeding
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Pages 46-55
ACM
New York, NY
, USA
©2004
table of contents
ISBN:1-58113-885-7
doi>
10.1145/997817.997827
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:
3d visibility
algorithms
computational geometry
counting problems
geometric algorithms, languages, and systems
geometrical problems and computations
theory
visibility complex
visible line/surface algorithms
visual events
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