Results 211 to 220 of about 4,255,094 (265)
Some of the next articles are maybe not open access.
An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles
International Symposium on Algorithms and Computation, 2010We study the problem of reconstructing a simple polygon: Given a cyclically ordered vertex sequence of an unknown simple polygon P of n vertices and, for each vertex v of P, the sequence of angles defined by all the visible vertices of v in P ...
D. Chen, Haitao Wang
semanticscholar +1 more source
Discrete & Computational Geometry, 2000
In this paper we investigate the problem of morphing (i.e., continuously deforming) one simple polygon into another. We assume that our two initial polygons have the same number of sides n , and that corresponding sides are parallel. We show that a morph is always possible through an interpolating simple polygon whose n sides vary but stay parallel to
John Hershberger +2 more
openaire +2 more sources
In this paper we investigate the problem of morphing (i.e., continuously deforming) one simple polygon into another. We assume that our two initial polygons have the same number of sides n , and that corresponding sides are parallel. We show that a morph is always possible through an interpolating simple polygon whose n sides vary but stay parallel to
John Hershberger +2 more
openaire +2 more sources
An Analysis and Investigation of Algorithms for Identifying Convexity-Concavity of a Simple Polygon
, 2011Algorithms for identifying convexity-concavity of a simple polygon has a very important application in many fields.The authors analyzed the present popular algorithms for identifying convexity-concavity of a simple polygon such as angling method,left ...
Cheng Chang-xiu Zhou Cheng-hu Song Xiao-mei
semanticscholar +1 more source
On some link distance problems in a simple polygon
IEEE Trans. Robotics Autom., 1990A technique is presented for preprocessing a simple polygon to answer link distance queries. The preprocessing requires linear time and the time to triangulate the polygon, and it uses linear storage.
S. Suri
semanticscholar +1 more source
Compliant motion in a simple polygon
Proceedings of the ninth annual symposium on Computational geometry - SCG '93, 1989We consider motion planning under the compliant motion model, in which a robot directed to walk into a wall may slide along it. We examine several variants of compliant motion planning for a point robot inside a simple polygon with n sides, where the goal is a fixed vertex or edge.
Jack Snoeyink +2 more
openaire +2 more sources
2011
Let p and q be two points in a simple polygon P. This chapter provides the Chazelle algorithm for computing the ESP between p and q that is contained in P. It uses triangulation of simple polygons as presented in the previous chapter as a preprocessing step, and has a time complexity that is determined by that of the prior triangulation.
Reinhard Klette, Fajie Li
openaire +2 more sources
Let p and q be two points in a simple polygon P. This chapter provides the Chazelle algorithm for computing the ESP between p and q that is contained in P. It uses triangulation of simple polygons as presented in the previous chapter as a preprocessing step, and has a time complexity that is determined by that of the prior triangulation.
Reinhard Klette, Fajie Li
openaire +2 more sources
k-Pairs Non-Crossing Shortest Paths in a Simple Polygon
International journal of computational geometry and applications, 1996This paper presents an O(n+k) time algorithm to compute the set of k non-crossing shortest paths between k source-destination pairs of points on the boundary of a simple polygon of n vertices.
Evanthia Papadopoulou
semanticscholar +1 more source
Area optimization of simple polygons
Proceedings of the ninth annual symposium on Computational geometry - SCG '93, 1993We discuss problems of optimizing the area of a simple polygon for a given set of vertices P and show that these problems are very closely related to problems of optimizing the number of points from a set Q in a simple polygon with vertex set P. We prove that it is NP-complete to find a minimum weight polygon or a maximum weight polygon for a given ...
William R. Pulleyblank +1 more
openaire +2 more sources
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
SIAM journal on computing (Print), 2000This paper describes an output-sensitive scheme to construct the visibility graph of a simple polygon with m obstacles and n vertices in optimal O(|E| +T + m log n ) time where |E| is the size of the visibility graph and T is the time required to ...
S. Kapoor, S. Maheshwari
semanticscholar +1 more source
Intersection removal for simple polygons
International Journal of Computer Mathematics, 1997Given two intersecting simple polygons A and B and a direction, θ, we have to find the minimum distance by which B should be translated along direction θ so that A and B no longer intersect. We present two algorithms for this problem for the case that A and B are in 2 dimensions and one algorithm for the case that they are in 3 dimensions.
Kamala Krithivasan, Sumeet Lahorani
openaire +2 more sources