ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
Filter
  • 1
    Electronic Resource
    Electronic Resource
    A tight upper bound for the number of intersections between two rectangular paths (1991)
    Springer
    BIT 31 (1991), S. 598-606 
    Details
    ISSN: 1572-9125
    Keywords: B.7.1 ; B.7.2 ; F.2.2 ; G.2.2 ; Computational geometry ; interference ; intersection ; rectangular path ; upper bound ; VLSI layout
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The problem of finding the number of intersections between two geometric figures in the plane has been studied extensively in literature. In this paper, the geometric figure comprising a continuous rectilinear path (called rectangular path) is considered, and a tight (least) upper bound onI(P, Q), the number of intersections between two rectangular pathsP andQ, is given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01933175
    Location Call Number Expected 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...