On arrangements of Jordan arcs with three intersections per pair

DOI10.1007/BF02187745zbMATH Open0687.05004WikidataQ56970911 ScholiaQ56970911MaRDI QIDQ1262864FDOQ1262864

Authors: Herbert Edelsbrunner, János Pach, Richard Pollack, Raimund Seidel, Leonidas Guibas, John Hershberger, Micha Sharir, Jack Snoeyink 

Publication date: 1989

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

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

Recommendations

• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Multicolor combination lemma
• On the number of regular vertices of the union of Jordan regions
• scientific article; zbMATH DE number 4060713
• Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the general motion-planning problem with two degrees of freedom
• Some dynamic computational geometry problems
• Title not available (Why is that?)
• 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
• Planar realizations of nonlinear Davenport-Schinzel sequences by segments
• Almost linear upper bounds on the length of general Davenport-Schinzel sequences
• Separating two simple polygons by a sequence of translations

Cited In (11)

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

This page was built for publication: On arrangements of Jordan arcs with three intersections per pair

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1262864)