Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons

No abstract is available for this paper.

• Publication year

  1983

• Venue

  IEEE transactions on computers

• Publication date

  1983-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TC.1983.1676186
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge

  1981cited by this paper
• A Linear Algorithm for Computing the Visibility Polygon from a Point

  1981cited by this paper
• Finding the Minimum Distance Between Two Convex Polygons

  1981cited by this paper
• Detection is easier than computation (Extended Abstract)

  1980cited by this paper
• An Optimal Algorithm for Finding the Kernel of a Polygon

  1979cited by this paper
• Algorithms for Reporting and Counting Geometric Intersections

  1979cited by this paper
• Finding the Intersection of two Convex Polyhedra

  1978cited by this paper
• Geometric intersection problems

  1976cited by this paper
• Geometric complexity

  1975cited by this paper

• On Computing the Time-varying Distance between Moving Bodies

  2023cites this paper
• Representing logic gates over Euclidean space via heaviside step function

  2022cites this paper
• An Efficient Algorithm for the Proximity Connected Two Center Problem

  2022influential citation
• On determining optimal strategies in pursuit games in the plane. (English)

  2022cites this paper
• Automatic assembly of aero engine low pressure turbine shaft based on 3D vision measurement

  2020cites this paper
• On Heaviside Binary Logic: a Mathematical Characterization and its Applications

  2020cites this paper
• An Approach to Computing Multipoint Inversion and Multiray Surface Intersection on Parametric Surface

  2019cites this paper
• Development of spreadsheet based quantity take-off and cost estimation application

  2018cites this paper
• Interpretation and Research On Landuse Based On Landsat 7 ETM Plus Remote Sensing Data

  2016cites this paper
• COMPUTATION OF THE SHORTEST DISTANCE BETWEEN TWO PARAMETRIC DEFINED OBJECTS BY PARTICLE SWARM OPTIMIZATION

  2015cites this paper
• The Discrete and Mixed Minimax 2-Center Problem

  2015cites this paper
• A System of Conservative Regridding for Ice-Atmosphere Coupling in a General Circulation Model (GCM)

  2014cites this paper
• Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra

  2014cites this paper
• Collision detection for three dimension objects in a fixed time

  2014cites this paper
• A system of conservative regridding for ice/atmosphere coupling in a GCM

  2013cites this paper
• A Brief Overview of Collision Detection

  2013cites this paper
• Angle-constrained manipulation for cubic B-spline with cusp and its applications

  2011cites this paper
• Notice of RetractionDynamics simulation efficiency of the chain-drive mechanism

  2010cites this paper
• The Collision Detection Algorithm Based on the Combination of Two-Dimensional and Dynamic Octree

  2009cites this paper
• A Near-Quadratic Algorithm for the Alpha-Connected Two-Center Problem

  2006cites this paper
• An algorithm for computing the distance between two circular disks

  2003cites this paper
• A fast algorithm for the alpha-connected two-center decision problem

  2003cites this paper
• Foot landmarking for footwear customization

  2003cites this paper
• Point inversion and projection for NURBS curve and surface: Control polygon approach

  2003cites this paper
• A Recursive Algorithm for On-line Clustering Obstacles Cluttered in Dynamic Environments

  2002cites this paper
• A near-quadratic algorithm for the alpha-connected two-center decision problem

  2002cites this paper
• A recursive algorithm of obstacles clustering for reducing complexity of collision detection in 2D environment

  2001cites this paper
• Geometric Interpretation and Comparisons of Enhancements of GJK Algorithm for Computing Euclidean Distance Between Convex Polyhedra

  2001cites this paper
• Evaluation of Buffer Queries in Spatial Databases

  2001cites this paper
• Penetration Depth of Two Convex Polytopes in 3D

  2000cites this paper
• Buffer Queries∗

  2000cites this paper
• An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn

  2000cites this paper
• Convex hull generation, connected component labelling, and minimum distance calculation for set-theoretically defined models

  2000cites this paper
• Synthesis of bent sheet metal parts from design features

  1999cites this paper
• Computing the Minimum Directed Distances Between Convex Polyhedra

  1999cites this paper
• Fuzzy distances for proximity characterization under uncertainty

  1999cites this paper
• Reducing the Complexity of Robot's Scene for Faster Collision Detection

  1999cites this paper
• On Determining Optimal Strategies in Pursuit Games in the Plane

  1998cites this paper
• A framework for efficient minimum distance computations

  1998cites this paper
• Minimum Distance Queries for Polygonal and Parametric Models

  1997cites this paper
• A genetic path planning algorithm for redundant articulated robots

  1997cites this paper
• Optimal Shortest Path and Minimum-Link Path Queries Between Two Convex Polygons Inside a Simple Polygonal Obstacle

  1997cites this paper
• Collision identification between convex polyhedra using neural networks

  1995cites this paper
• Translation queries for sets of polygons

  1995cites this paper
• Dynamic and i/o-efficient algorithms for computational geometry and graph problems: theoretical and experimental results

  1995cites this paper
• Collision Identification Between Convex

  1995cites this paper
• Determining the separation of simple polygons

  1994cites this paper
• Optimal Shortest Path and Minimum-Link Path Queries in the Presence of Obstacles (Extended Abstract)

  1994cites this paper
• Efficient collision detection for real-time simulated environments

  1994cites this paper
• Optimal Shortest Path and Minimum-link Path Queries between Two Convex Polygons in the Presence of Obstacles Optimal Shortest Path and Minimum-link Path Queries between Two Convex Polygons in the Presence of Obstacles

  1994cites this paper
• Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs

  1993cites this paper
• System for the implementation and kinesthetic display of virtual environments

  1993influential citation
• A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects

  1993cites this paper
• An Optimal Algorithm for Finding the Separation of Simple Polygons

  1993cites this paper
• Computing the intersection-depth of polyhedra

  1993cites this paper
• A New Model for Efficient Dynamic Simulation

  1993cites this paper
• Algorithms for Weak and Wide Separation of Sets

  1993cites this paper
• Real time simulation of stiff dynamic systems via distributed memory parallel processors

  1993cites this paper
• Computation of certain measures of proximity between convex polytopes: a complexity viewpoint

  1992cites this paper
• A model for polygon similarity estimation

  1992cites this paper
• A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects

  1992cites this paper
• Fuzzy proximity measures for robot grasp planning

  1992cites this paper
• Local geometric issues for spatial reasoning in robot motion planning

  1991cites this paper
• Task-specific control of a robotic aid for disabled people

  1990cites this paper
• Determining the Separation of Preprocessed Polyhedra -- A Unified Approach

  1990cites this paper
• Determining the Separation of Preprocessed Polyhedra - A Unified Approach

  1990cites this paper
• A Bibliography on Digital and Computational Convexity (1961-1988)

  1989cites this paper
• A Direct Minimization Approach for Obtaining the Distance between Convex Polyhedra

  1989cites this paper
• Graphical stability analysis for control systems with model parameter uncertainties

  1989cites this paper
• A fast procedure for computing the distance between complex objects in three-dimensional space

  1988cites this paper
• A fast procedure for computing the distance between complex objects in three space

  1987cites this paper
• On Some Distance Problems in Fixed Orientations

  1987cites this paper
• An optimal algorithm for constructing the Delaunay triangulation of a set of line segments

  1987cites this paper
• Finding the minimum visible vertex distance between two non-intersecting simple polygons

  1986cites this paper
• Optimum watchman routes

  1986cites this paper
• Distance problems in computational geometry with fixed orientations

  1985cites this paper
• Finding the minimum vertex distance between two disjoint convex polygons in linear time

  1985cites this paper
• Computing the Extreme Distances Between Two Convex Polygons

  1985cites this paper
• Picture processing: 1984

  1985cites this paper
• A unifying approach for a class of problems in the computational geometry of polygons

  1985cites this paper
• A Linear Algorithm for Determining the Separation of Convex Polyhedra

  1985cites this paper
• Minimum Vertex Distance Between Separable Convex Polygons

  1984cites this paper
• Computational Geometry—A Survey

  1984cites this paper
• Measured Flip-Flop Responses to Marginal Triggering

  1983cites this paper
• Lê On Determining Optimal Strategies in Pursuit Games in the Plane

  year unknowncites this paper