On arrangements of Jordan arcs with three intersections per pair

DOI10.1007/BF02187745zbMath0687.05004WikidataQ56970911 ScholiaQ56970911MaRDI QIDQ1262864

Raimund Seidel, János Pach, Herbert Edelsbrunner, Richard Pollack, Micha Sharir, Jack Scott Snoeyink, J. E. Hershberger, Leonidas J. Guibas

Publication date: 1989

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131094

zbMATH Keywords

functional inverse of Ackermann's functionregions bounded by Jordan curves in the plane

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumerative combinatorics (05A99)

Related Items

On fat partitioning, fat covering and the union size of polygons, Embeddability of arrangements of pseudocircles and graphs on surfaces, Near-linear approximation algorithms for geometric hitting sets, Improved approximation bounds for the minimum constraint removal problem, On \(k\)-sets in arrangements of curves and surfaces, On fat partitioning, fat covering and the union size of polygons, On the general motion-planning problem with two degrees of freedom, The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some dynamic computational geometry problems
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• Almost linear upper bounds on the length of general Davenport-Schinzel sequences
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Separating two simple polygons by a sequence of translations
• On the general motion-planning problem with two degrees of freedom