Results 1  10
of
7,762
On Inducing ngons
 CCCG
, 2011
"... In this paper, we establish a lower bound on the number of inducing simple ngons in gridlike arrangements of lines. We also show that the complexity associated with counting the number of inducing ngons in an arrangement of collinear segments is #Pcomplete. ..."
Abstract
 Add to MetaCart
In this paper, we establish a lower bound on the number of inducing simple ngons in gridlike arrangements of lines. We also show that the complexity associated with counting the number of inducing ngons in an arrangement of collinear segments is #Pcomplete.
Inducing ngon of an arrangement of lines
"... We show that an arrangement A of n lines in general position in the plane with n ≥ 3 has an inducing polygon of size n. The proof is constructive, that is we describe an algorithm that constructs a simple ngon inducing A. 1 ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We show that an arrangement A of n lines in general position in the plane with n ≥ 3 has an inducing polygon of size n. The proof is constructive, that is we describe an algorithm that constructs a simple ngon inducing A. 1
Inducing ngon of a line arrangement
, 2008
"... We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size n. The proof is constructive, that is, we describe an O(n log n) time algorithm that constructs a simple ngon inducing A. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size n. The proof is constructive, that is, we describe an O(n log n) time algorithm that constructs a simple ngon inducing A.
Very homogeneous generalized ngons of finite Morley
 Rank, J. London Math. Soc. II
, 2000
"... (Almost strongly minimal) generalized ngons are constructed for all n�3 for which the automorphism group acts transitively on the set of ordered ordinary (n�1)gons contained in it, a new class of BNpairs thus being obtained. Through the construction being modified slightly, 2 � � many nonisomor ..."
Abstract

Cited by 13 (6 self)
 Add to MetaCart
isomorphic almost strongly minimal generalized ngons are obtained for all n�3, none of which interprets an infinite group. Furthermore, a characterization is given of all graphs whose simple cycles all have length 2n for some n�3. 1. Preliminaries A generalized ngon is a bipartite graph (with respect to a
THE MINIMUM AREA OF CONVEX LATTICE nGONS
, 2001
"... Let A(n) be the minimum area of convex lattice ngons. We prove that limA(n)/n3 exists. Our computations suggest that the value of the limit is very close to 0.0185067.... 1. ..."
Abstract
 Add to MetaCart
Let A(n) be the minimum area of convex lattice ngons. We prove that limA(n)/n3 exists. Our computations suggest that the value of the limit is very close to 0.0185067.... 1.
A series of coverings of the regular ngon
, 2011
"... We define an infinite series of translation coverings of Veech’s doublengon for odd n ≥ 5 which share the same Veech group. Additionally we give an infinite series of translation coverings with constant Veech group of a regular ngon for even n ≥ 8. These families give rise to explicit examples of ..."
Abstract
 Add to MetaCart
We define an infinite series of translation coverings of Veech’s doublengon for odd n ≥ 5 which share the same Veech group. Additionally we give an infinite series of translation coverings with constant Veech group of a regular ngon for even n ≥ 8. These families give rise to explicit examples
Conformal mapping in linear time
, 2006
"... Abstract. Given any ɛ> 0 and any planar region Ω bounded by a simple ngon P we construct a (1 + ɛ)quasiconformal map between Ω and the unit disk in time C(ɛ)n. One can take C(ɛ) = C + C log 1 ɛ log log ..."
Abstract

Cited by 19 (13 self)
 Add to MetaCart
Abstract. Given any ɛ> 0 and any planar region Ω bounded by a simple ngon P we construct a (1 + ɛ)quasiconformal map between Ω and the unit disk in time C(ɛ)n. One can take C(ɛ) = C + C log 1 ɛ log log
A FAST MAPPING THEOREM FOR POLYGONS 1
, 2008
"... Abstract. Given a simple ngon P in the plane, normalized to contain the unit disk, we dene a map from P to the unit circle so that (1) the map extends to be 8quasiconformal on the interior, (2) it contracts arclength on the boundary and (3) the images of all n vertices can be computed in time O(n) ..."
Abstract
 Add to MetaCart
Abstract. Given a simple ngon P in the plane, normalized to contain the unit disk, we dene a map from P to the unit circle so that (1) the map extends to be 8quasiconformal on the interior, (2) it contracts arclength on the boundary and (3) the images of all n vertices can be computed in time O(n
Results 1  10
of
7,762