The common exterior of convex polygons in the plane
From MaRDI portal
(Redirected from Publication:1367170)
Recommendations
Cites work
- An optimal algorithm for the boundary of a cell in a union of rays
- Applications of random sampling in computational geometry. II
- Combinatorial complexity bounds for arrangements of curves and spheres
- Construction of \(\epsilon\)-nets
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4063941 (Why is no real title available?)
- scientific article; zbMATH DE number 3682574 (Why is no real title available?)
- scientific article; zbMATH DE number 732977 (Why is no real title available?)
- On the general motion-planning problem with two degrees of freedom
- On the maximal number of edges of many faces in an arrangement
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Planar realizations of nonlinear Davenport-Schinzel sequences by segments
- The complexity and construction of many faces in arrangements of lines and of segments
- The number of edges of many faces in a line segment arrangement
- The Union of Convex Polyhedra in Three Dimensions
- Voronoi diagrams of rigidly moving sets of points
Cited in
(7)- On the complexity of umbra and penumbra
- On incremental rendering of silhouette maps of a polyhedral scene
- On the number of regular vertices of the union of Jordan regions
- RED-BLUE SEPARABILITY PROBLEMS IN 3D
- On the number of regular vertices of the union of Jordan regions
- Efficient view point selection for silhouettes of convex polyhedra
- The farthest color Voronoi diagram in the plane
This page was built for publication: The common exterior of convex polygons in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367170)