SIGN IN
SIGN UP
Construction of contour trees in 3D in
O(n
log
n
) steps
Full Text:
PDF
Buy this Article
Authors:
Sergey P. Tarasov
Computing Center of RAS, Vavilova 40, 117967 Moscow GSP-1, Russia
Michael N. Vyalyi
Computing Center of RAS, Vavilova 40, 117967 Moscow GSP-1, Russia
Published in:
· Proceeding
SCG '98
Proceedings of the fourteenth annual symposium on Computational geometry
Pages 68-75
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-973-4
doi>
10.1145/276884.276892
1998 Article
Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 27
· Downloads (cumulative): 486
· Citation Count: 24
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
design
geometrical problems and computations
graph algorithms
theory
trees
verification
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