ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Springer
    The visual computer 12 (1996), S. 173-180 
    ISSN: 1432-2315
    Keywords: Key words: Spanning line segments ; Skeletons ; Plane polyhedron intersections
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: P preserves the property of intersection; that is, a plane intersects P if and only if it also intersects ?. This paper gives a linear time algorithm for constructing ? for a polyhedron with N extreme vertices. If N is odd, the algorithm is optimal in yielding ⌊N/2⌋+1 spanning line segments. If N is even, it gives (N/2)+1, which is optimal in some cases and nearly optimal in others.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 12 (1996), S. 173-180 
    ISSN: 1432-2315
    Keywords: Spanning line segments ; Skeletons ; Plane polyhedron intersections
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A set of spanning line segments ℊ in a polyhedronP preserves the property of intersection; that is, a plane intersectsP if and only if it also intersects ℊ. This paper gives a linear time algorithm for constructing ℊ for a polyhedron withN extreme vertices. IfN is odd, the algorithm is optimal in yielding [N/2] + 1 spanning line segments. IfN is even, it gives (N/2) + 1, which is optimal in some cases and nearly optimal in others.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...