English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling

Ramos, E. A., Amato, N. M., & Goodrich, M. T. (2000). Computing the arrangement of curve segments: Divide-and-conquer algorithms via sampling. In N. M. Amato, & M. T. Goodrich (Eds.), Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00) (pp. 705-706). New York, USA: ACM Press.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Ramos, Edgar A.1, Author           
Amato, Nancy M., Author
Goodrich, Michael T., Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-022000
 Publication Status: Issued
 Pages: -
 Publishing info: New York, USA : ACM Press
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518134
URI: http://www.mpi-sb.mpg.de/~ramos/
Other: Local-ID: C1256428004B93B8-FA76FD5AEAA91D82C12569FC0058FD85-Ramos2000e
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: San Francisco, CA, USA
Start-/End Date: 2000-01-09 - 2000-01-11

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-00)
Source Genre: Proceedings
 Creator(s):
Amato, Nancy M., Editor
Goodrich, Michael T., Editor
Affiliations:
-
Publ. Info: New York, USA : ACM Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 705 - 706 Identifier: -