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
  • 1
    Electronic Resource
    Electronic Resource
    Finding minimal nested polygons (1991)
    Springer
    BIT 31 (1991), S. 230-236 
    Details
    ISSN: 1572-9125
    Keywords: F.1.2 ; Algorithm ; Complexity ; Computational geometry ; Minimal nested polygon
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An algorithm for finding a polygon with minimum number of edges nested in two simplen-sided polygons is presented. The algorithm solves the problem in at mostO(n logn) time, and improves the time complexity of two previousO(n 2) algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01931283
    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...