Topic

# Regular polygon

About: Regular polygon is a(n) research topic. Over the lifetime, 4495 publication(s) have been published within this topic receiving 68009 citation(s).

##### Papers

More filters

•

01 Apr 1985-

Abstract: Foreword Preface 1. Sobolev spaces 2. Regular second-order elliptic boundary value problems 3. Second-order elliptic boundary value problems in convex domains 4. Second-order boundary value problems in polygons 5. More singular solutions 6. Results in spaces of Holder functions 7. A model fourth-order problem 8. Miscellaneous Bibliography Index.

4,904 citations

••

Esther M. Arkin

^{1}, L.P. Chew^{1}, Daniel P. Huttenlocher^{1}, Klara Kedem^{1}+1 more•Institutions (1)TL;DR: A method for comparing polygons that is a metric, invariant under translation, rotation, and change of scale, reasonably easy to compute, and intuitive is presented.

Abstract: A method for comparing polygons that is a metric, invariant under translation, rotation, and change of scale, reasonably easy to compute, and intuitive is presented. The method is based on the L/sub 2/ distance between the turning functions of the two polygons. It works for both convex and nonconvex polygons and runs in time O(mn log mn), where m is the number of vertices in one polygon and n is the number of vertices in the other. Some examples showing that the method produces answers that are intuitively reasonable are presented. >

710 citations

••

01 Mar 1983-

TL;DR: An algorithm is presented which efficiently finds good collision-free paths for convex polygonal bodies through space littered with obstacle polygons by characterizing the volume swept by a body as it is translated and rotated as a generalized cone.

Abstract: Free space is represented as a union of (possibly overlapping) generalized cones. An algorithm is presented which efficiently finds good collision-free paths for convex polygonal bodies through space littered with obstacle polygons. The paths are good in the sense that the distance of closest approach to an obstacle over the path is usually far from minimal over the class of topologically equivalent collision-free paths. The algorithm is based on characterizing the volume swept by a body as it is translated and rotated as a generalized cone, and determining under what conditions one generalized cone is a subset of another.

653 citations

01 Jan 1983-

TL;DR: This paper shows that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once, and that this simple idea can be generalized in two ways.

Abstract: Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be used on several convex polygons simultaneously. We then show that these generalizations allow us to obtain simple O(n) algorithms for solving a variety of problems defined on convex polygons. Such problems include (1) finding the minimum-area rectangle enclosing a polygon, (2) computing the maximum distance between two polygons, (3) performing the vector-sum of two polygons, (4) merging polygons in a convex hull finding algorithms, and (5) finding the critical support lines between two polygons. Finding the critical support lines, in turn, leads to obtaining solutions to several additional problems concerned with visibility, collision, avoidance, range fitting, linear separability, and computing the Grenander distance between sets.

565 citations

••

01 Jun 1991-

TL;DR: A new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the listing of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension is presented.

Abstract: We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following properties:(a)Virtually no additional storage is required beyond the input data.(b)The output list produced is free of duplicates.(c)The algorithm is extremely simple, requires no data structures, and handles all degenerate cases.(d)The running time is output sensitive for nondegenerate inputs.(e)The algorithm is easy to parallelize efficiently.
For example, the algorithm finds thev vertices of a polyhedron inRd defined by a nondegenerate system ofn inequalities (or, dually, thev facets of the convex hull ofn points inRd, where each facet contains exactlyd given points) in timeO(ndv) andO(nd) space. Thev vertices in a simple arrangement ofn hyperplanes inRd can be found inO(n2dv) time andO(nd) space complexity. The algorithm is based on inverting finite pivot algorithms for linear programming.

561 citations