scientific article; zbMATH DE number 1424289
From MaRDI portal
Publication:4945501
zbMath0952.68148MaRDI QIDQ4945501
Micha Sharir, Pankaj K. Agarwal
Publication date: 23 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmic problemsDavenport-Schinzel sequencesgeometric problemsarrangements of lines, segments, and arcs
Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Enumerative combinatorics (05A99) Special sequences and polynomials (11B83)
Related Items (24)
Extremal problems for ordered hypergraphs: small patterns and some enumeration ⋮ Generalized Davenport-Schinzel sequences ⋮ Rearranging a sequence of points onto a line ⋮ Shortest Path Problems on a Polyhedral Surface ⋮ Minimizing the Weighted Directed Hausdorff Distance between Colored Point Sets under Translations and Rigid Motions ⋮ Convex blocking and partial orders on the plane ⋮ Shortest paths in time-dependent FIFO networks ⋮ Link distance and shortest path problems in the plane ⋮ Unions of fat convex polytopes have short skeletons ⋮ Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences ⋮ Shortest path problems on a polyhedral surface ⋮ Scandinavian thins on top of cake: new and improved algorithms for stacking and packing ⋮ Hide-and-Seek: Algorithms for Polygon Walk Problems ⋮ Color-spanning localized query ⋮ Capturing crossings: convex hulls of segment and plane intersections ⋮ Untangling planar graphs from a specified vertex position-Hard cases ⋮ Largest empty circle centered on a query line ⋮ Facility location problems with uncertainty on the plane ⋮ Voronoi game on polygons ⋮ Link Distance and Shortest Path Problems in the Plane ⋮ Ready, set, go! The Voronoi diagram of moving points that start from a line ⋮ Unnamed Item ⋮ The geometry of Minkowski spaces -- a survey. II. ⋮ On the zone of the boundary of a convex body
This page was built for publication:
