Finding the minimum visible vertex distance between two non-intersecting simple polygons

No abstract is available for this paper.

• Publication year

  1986

• Venue

  SCG '86

• Publication date

  1986-08-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1145/10515.10519
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distance problems in computational geometry with fixed orientations

  1985influential reference
• Finding minimal convex nested polygons

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

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

  1985cited by this paper
• A new linear convex hull algorithm for simple polygons

  1984cited by this paper
• Computational Geometry—A Survey

  1984cited by this paper
• Triangulating Simple Polygons and Equivalent Problems

  1984cited by this paper
• Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons

  1983cited by this paper
• Generalization of Voronoi Diagrams in the Plane

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

  1980cited by this paper
• Efficient computation of continuous skeletons

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

  1979cited by this paper
• Triangulating a Simple Polygon

  1978cited by this paper
• Short Communications / Kurze Mitteilungen An Optimal Algorithm for Computing the Minimum Vertex Distance Between Two Crossing Convex Polygons*

  year unknowncited by this paper

• Computing Instance-Optimal Kernels in Two Dimensions

  2022cites this paper
• Minimum Link Fencing

  2022cites this paper
• A framework for synchronizing a team of aerial robots in communication-limited environments

  2019cites this paper
• A General Framework for Synchronizing a Team of Robots Under Communication Constraints

  2017cites this paper
• A Survey of Computational Geometry

  2014cites this paper
• Circle Separability Queries in Logarithmic Time

  2012cites this paper
• Approximation Algorithms for Geometric Separation Problems

  2009cites this paper
• Link Distance Problems

  2000cites this paper
• Finding a closest visible vertex pair between two polygons

  1995cites this paper
• Determining the separation of simple polygons

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

  1993cites this paper
• Separation and approximation of polyhedral objects

  1992influential citation
• Optimal link path queries in a simple polygon

  1992cites this paper
• Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract)

  1991cites this paper
• Computing the Visibility Polygon from a Convex Set and Related Problems

  1991cites this paper
• Finding minimal nested polygons

  1991cites this paper
• Applications of generalized matrix searching to geometric algorithms

  1990cites this paper
• Computing the Minimum Visible Vertex Distance between Two Polygons (Preliminary Version)

  1989cites this paper
• Finding minimal convex nested polygons

  1985cites this paper