Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Key words. Computational geometry, Convex geometry, Shape matching, Centroid.  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 21 (1998), S. 89-103 
    ISSN: 1432-0541
    Keywords: Key words. Computational geometry, Convex geometry, Shape matching, Centroid.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. This paper deals with questions from convex geometry related to shape matching. In particular, we consider the problem of moving one convex figure over another, minimizing the area of their symmetric difference. We show that if we just let the two centers of gravity coincide, the resulting symmetric difference is within a factor of 11/3 of the optimum. This leads to efficient approximate matching algorithms for convex figures.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...