Results 91 to 100 of about 4,255,094 (265)
On the perimeters of simple polygons contained in a disk [PDF]
Monatshefte für Mathematik, 2010 A simple $n$-gon is a polygon with $n$ edges with each vertex belonging to exactly two edges and every other point belonging to at most one edge. Brass asked the following question: For $n \geq 5$ odd, what is the maximum perimeter of a simple $n$-gon contained in a Euclidean unit disk?
openaire +4 more sources
An optimal algorithm for finding all visible edges in a simple polygon
IEEE Trans. Robotics Autom., 1989 By treating the floor plan of the building as a polygon, the authors study the problem of locating a camera for surveillance. A polygon P is point-visible if there exists a point x in P such that every other point in P is visible from x.
Sung-yong Shin, T. Woo
semanticscholar +1 more source
A linear-time algorithm for triangulating simple polygons [PDF]
, 1986 Robert E. Tarjan, Christopher J. Van Wyk
openalex +1 more source
A Simple Polygon Search Algorithm
Journal of the Korea Society of Computer and Information, 2016 This paper considers simple polygon search problem. How many searchers find a mobile intruder that is arbitrarily faster than the searcher within polygon art gallery? This paper uses the visibility graph that is connected with edges for mutually visible vertices. Given visibility graph, we select vertex that is conjunction in for ≤
openaire +3 more sources
Polygon triangulation inO(n log logn) time with simple data structures [PDF]
, 1992 David Kirkpatrick +2 more
openalex +1 more source
Fixed points of mapping of N-point gravitational lenses
Odessa Astronomical Publications, 2018 In this paper, we study fixed points of N-point gravitational lenses. We use complex form of lens mapping to study fixed points. Complex form has an advantage over coordinate one because we can describe N-point gravitational lens by system of two equation ...
A. T. Kotvytskiy +2 more
doaj +1 more source
Computing a single cell in the overlay of two simple polygons [PDF]
, 1997 Mark de Berg +3 more
openalex +1 more source
Minimum-Length Polygons in Simple Cube-Curves [PDF]
, 2000 Reinhard Klette, Thomas Bülow
openalex +1 more source
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons [PDF]
, 2004 Siu-Wing Cheng +3 more
openalex +1 more source
Minkowski Sums of Monotone and General Simple Polygons [PDF]
, 2005 Eduard Oks, Micha Sharir
openalex +1 more source