Library

X
You have 0 saved results.
Mark results and click the "Add To Watchlist" link in order to add them to this list.
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
    On sorting triangles in a delaunay tessellation (1991)
    Springer
    Algorithmica 6 (1991), S. 522-532 
    Details
    ISSN: 1432-0541
    Keywords: Delaunay triangulation ; Sorting ; Visibility
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In a two-dimensional Delaunay-triangulated domain, there exists a partial ordering of the triangles (with respect to a vertex) that is consistent with the two-dimensional visibility of the triangles from that vertex. An equivalent statement is that a polygon that is star-shaped with respect to a given vertex can be extended, one triangle at a time, until it includes the entire domain. Arbitrary planar triangulations do not possess this useful property which allows incremental processing of the triangles.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01759057
    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...