Library

X
feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
back to result list
  • 1
    Electronic Resource
    Electronic Resource
    Largest Placement of One Convex Polygon Inside Another (1998)
    Springer
    Discrete & computational geometry 19 (1998), S. 95-104 
    Details
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract. We show that the largest similar copy of a convex polygon P with m edges inside a convex polygon Q with n edges can be computed in O(mn 2 log n) time. We also show that the combinatorial complexity of the space of all similar copies of P inside Q is O(mn 2 ) , and that it can also be computed in O(mn 2 log n) time.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/PL00009337
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...