skip to main content
10.1145/1064092.1064149acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article

Reconstructing collections of arbitrary curves

Authors Info & Claims
Published:06 June 2005Publication History

ABSTRACT

The presented alg rithm rec nstructs collections of arbitrary curves (open, closed, smooth, with corners, with or without intersections). The algorithm is very simple and short and follows a novel and simple greedy strategy. The corner and intersection points are not required to but allowed to be in the sample. The described method works for curves in any dimension d asymptotically in O (n2-1/d) time with involved data structures. Experiments show already a good performance with a very simple kd-tree structure.

References

  1. S.N. Bespamyatnikh. An optimal algorithm for closest pair maintenance. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 152--161, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T.K. Dey, K. Mehlhorn, and E.A. Ramos. Curve reconstruction: Connecting dots with good reason. Comput. Geom. Theory Appl., 15:229--244,2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. T. Lenz. Simple reconstruction of non-simple curves. Technical Report B 05-02, Freie Universitat Berlin, March 2005.Google ScholarGoogle Scholar
  4. J. Matousek. Range searching with efficient hierarchical cuttings. Discrete Comput. Geom., 10(2): 157--182, 1993.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Reconstructing collections of arbitrary curves

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry
      June 2005
      398 pages
      ISBN:1581139918
      DOI:10.1145/1064092

      Copyright © 2005 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 6 June 2005

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SCG '05 Paper Acceptance Rate41of141submissions,29%Overall Acceptance Rate625of1,685submissions,37%
    • Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)1

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader