SIGN IN
SIGN UP
An experimental study of point location in planar arrangements in CGAL
Full Text:
PDF
Buy this Article
Authors:
Idit Haran
Tel-Aviv University, Tel-Aviv, Israel
Dan Halperin
Tel-Aviv University, Tel-Aviv, Israel
Published in:
· Journal
Journal of Experimental Algorithmics (JEA)
JEA Homepage
archive
Volume 13, February 2009
Article No. 3
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1412228.1412237
2009 Article
Research
Refereed
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 52
· Downloads (cumulative): 309
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
arrangements
cgal
computational geometry
experimentation
generic programming
geometrical problems and computations
performance
point location
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