scientific article
From MaRDI portal
Publication:3997899
zbMath0729.68082MaRDI QIDQ3997899
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Combinatorial geometries and geometric closure systems (51D20)
Related Items (14)
Two segment classes with Hamiltonian visibility graphs ⋮ Efficient algorithms for counting and reporting pairwise intersections between convex polygons ⋮ Using sparsification for parametric minimum spanning tree problems ⋮ Computing common tangents without a separating line ⋮ Extremal functions for sequences ⋮ Optimal partition trees ⋮ Approximating the k-Level in Three-Dimensional Plane Arrangements ⋮ Searching for segments with largest relative overlap ⋮ Ray shooting and stone throwing with near-linear storage ⋮ Optimal deterministic algorithms for 2-d and 3-d shallow cuttings ⋮ On regular vertices of the union of planar convex objects ⋮ On numbers of Davenport-Schinzel sequences ⋮ Counting and representing intersections among triangles in three dimensions ⋮ Visibility with a moving point of view
This page was built for publication:
