Pages that link to "Item:Q3741079"

The following pages link to Computing the extreme distances between two convex polygons (Q3741079):

Displaying 34 items.

• Data imprecision under \(\lambda\)-geometry model (Q527138) (← links)
• Fitting a two-joint orthogonal chain to a point set (Q617541) (← links)
• Algorithms for weak and wide separation of sets (Q686422) (← links)
• A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
• Computing shortest transversals (Q757096) (← links)
• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons (Q786507) (← links)
• New variants of perfect non-crossing matchings (Q831710) (← links)
• A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram (Q863827) (← links)
• Finding the minimum vertex distance between two disjoint convex polygons in linear time (Q1071519) (← links)
• Shortest paths in the plane with convex polygonal obstacles (Q1085615) (← links)
• k-th shortest collision-free path planning (Q1092820) (← links)
• Parallel algorithms for some functions of two convex polygons (Q1105374) (← links)
• On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
• New results on binary space partitions in the plane (Q1370930) (← links)
• Spanning trees in multipartite geometric graphs (Q1755734) (← links)
• A unifying approach for a class of problems in the computational geometry of polygons (Q1822499) (← links)
• A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
• \(\alpha\)-kernel problem with fuzzy visibility (Q1920271) (← links)
• An approach to computing multipoint inversion and multiray surface intersection on parametric surface (Q2298351) (← links)
• Computing the intersection-depth to polyhedra (Q2366234) (← links)
• Point inversion and projection for nurbs curve and surface: control polygon approach (Q2388497) (← links)
• Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties (Q2444559) (← links)
• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
• Computation of penetration between smooth convex objects in three-dimensional space (Q4348622) (← links)
• COMPUTING CONSTRAINED SHORTEST SEGMENTS: BUTTERFLY WINGSPANS IN LOGARITHMIC TIME (Q4513231) (← links)
• (Q4949363) (← links)
• New results on binary space partitions in the plane (extended abstract) (Q5056166) (← links)
• Computing common tangents without a separating line (Q5057432) (← links)
• An optimal algorithm for finding the separation of simple polygons (Q5060097) (← links)
• A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects (Q5060127) (← links)
• A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784) (← links)
• An efficient algorithm for the three-dimensional diameter problem (Q5932809) (← links)
• New variants of perfect non-crossing matchings (Q6180638) (← links)