Computing the extreme distances between two convex polygons
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3854463
- scientific article; zbMATH DE number 740451
- scientific article; zbMATH DE number 865984
- scientific article; zbMATH DE number 970811
- scientific article; zbMATH DE number 2202078
- On the extremal distance between two convex bodies
- Counting large distances in convex polygons: a computational approach
- Counting large distances in convex polygons: a computational approach
- scientific article; zbMATH DE number 1796963
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
Cited in
(47)- Finding the minimum vertex distance between two disjoint convex polygons in linear time
- Shortest paths in the plane with convex polygonal obstacles
- Maximal distance for robotic simulation: The convex case
- k-th shortest collision-free path planning
- Parallel algorithms for some functions of two convex polygons
- Computing external farthest neighbors for a simple polygon
- On determining optimal strategies in pursuit games in the plane
- New results on binary space partitions in the plane
- Spanning trees in multipartite geometric graphs
- A unifying approach for a class of problems in the computational geometry of polygons
- Some aperture-angle optimization problems
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- \(\alpha\)-kernel problem with fuzzy visibility
- An approach to computing multipoint inversion and multiray surface intersection on parametric surface
- Computing the intersection-depth to polyhedra
- Point inversion and projection for nurbs curve and surface: control polygon approach
- Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
- The Minkowskij distance between two disjoint convex polyhedral sets
- Fast computation of distance between two disjoint 2D convex regions with curved boundaries
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- scientific article; zbMATH DE number 3854463 (Why is no real title available?)
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- A linear time algorithm for the computation of some distance functions between convex polygons
- scientific article; zbMATH DE number 140466 (Why is no real title available?)
- Computing deviations from convexity in polygons
- Computation of penetration between smooth convex objects in three-dimensional space
- COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME
- scientific article; zbMATH DE number 1440920 (Why is no real title available?)
- New results on binary space partitions in the plane (extended abstract)
- Computing common tangents without a separating line
- An optimal algorithm for finding the separation of simple polygons
- A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
- A plane-sweep algorithm for finding a closest pair among convex planar objects
- Data imprecision under \(\lambda\)-geometry model
- scientific article; zbMATH DE number 2202078 (Why is no real title available?)
- Maximum distance between a point and a compact set in the plane. II
- An efficient algorithm for the three-dimensional diameter problem
- Fitting a two-joint orthogonal chain to a point set
- New variants of perfect non-crossing matchings
- Algorithms for weak and wide separation of sets
- Distributed self-triggered formation control for multiple mobile robots with dynamic mappings
- On the discrete and semi-continuous versions of the two-watchtower problem in the plane
- Computing shortest transversals
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- New variants of perfect non-crossing matchings
- A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram
This page was built for publication: Computing the extreme distances between two convex polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741079)
