Results 1  10
of
223
On Optimal Approximation of Orthogonal Polygons
"... In this paper we consider the following problem in computational geometry which has applications in VLSI floorplan design and image processing. Given an orthogonal polygon P (i.e. edges are either vertical or horizontal) with n vertices and a positive integer m ! n, determine an orthogonal polygon ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we consider the following problem in computational geometry which has applications in VLSI floorplan design and image processing. Given an orthogonal polygon P (i.e. edges are either vertical or horizontal) with n vertices and a positive integer m ! n, determine an orthogonal polygon
Generating Random Orthogonal Polygons
 IN POSTCONFERENCE PROC. OF CAEPIATTIA’2003, LNAI, SPRINGERVERLAG
, 2003
"... We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a con ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a technique we developed to obtain polygons with an increasing number of vertices starting from a unit square. The other follows a
On Tilable Orthogonal Polygons
"... We consider rectangular tilings of orthogonal polygons with vertices located at integer lattice points. Let G be a set of reals closed under the usual addition operation. A Grectangle is a rectangle at least one of whose sides is in G. We show that if an orthogonal polygon without holes can be tile ..."
Abstract
 Add to MetaCart
We consider rectangular tilings of orthogonal polygons with vertices located at integer lattice points. Let G be a set of reals closed under the usual addition operation. A Grectangle is a rectangle at least one of whose sides is in G. We show that if an orthogonal polygon without holes can
Domino Tilings of Orthogonal Polygons
"... We consider orthogonal polygons with vertices located at integer lattice points. We show that if all of the sides of a simple orthogonal polygon without holes have odd lengths, then it cannot be tiled by dominoes. We provide similar characterizations for orthogonal polygons with sides of arbitrary l ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We consider orthogonal polygons with vertices located at integer lattice points. We show that if all of the sides of a simple orthogonal polygon without holes have odd lengths, then it cannot be tiled by dominoes. We provide similar characterizations for orthogonal polygons with sides of arbitrary
Tilings of orthogonal polygons with similar rectangles or triangles
 Journal of Applied Mathematics & Computing
"... Abstract. In this paper we prove two results about tilings of orthogonal polygons. (1) Let P be an orthogonal polygon with rational vertex coordinates and let R(u) be a rectangle with side lengths u and 1. An orthogonal polygon P can be tiled with similar copies of R(u) if and only if u is algebra ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In this paper we prove two results about tilings of orthogonal polygons. (1) Let P be an orthogonal polygon with rational vertex coordinates and let R(u) be a rectangle with side lengths u and 1. An orthogonal polygon P can be tiled with similar copies of R(u) if and only if u is alge
Directly Visible Pairs and Illumination by Reflections in Orthogonal Polygons
"... We consider direct visibility in simple orthogonal polygons and derive tight lower and upper bounds on the number of strictly internal and external visibility edges. We also show a lower bound of ⌈ n 2 ⌉ − 1 on the number of diffuse reflections required for completely illuminating an orthogonal pol ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider direct visibility in simple orthogonal polygons and derive tight lower and upper bounds on the number of strictly internal and external visibility edges. We also show a lower bound of ⌈ n 2 ⌉ − 1 on the number of diffuse reflections required for completely illuminating an orthogonal
Partitioning Orthogonal Polygons into Fat Rectangles in Polynomial Time
, 2002
"... We provide a polynomialtime algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is "thin"; all rectangles are "fat." 1 ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We provide a polynomialtime algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is "thin"; all rectangles are "fat." 1
A.: Vertex Guards in a Subclass of Orthogonal Polygons
 International Journal of Computer Science and Network Security (IJCSNS
, 2006
"... Summary We call grid nogon each nvertex orthogonal simple polygon, with no collinear edges, that may be placed in a ) 2 / ( ) 2 / ( n n × unit square grid. In this paper we consider the Minimum Vertex Guard problem for this class of orthogonal polygons. As a step for the resolution of this genera ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Summary We call grid nogon each nvertex orthogonal simple polygon, with no collinear edges, that may be placed in a ) 2 / ( ) 2 / ( n n × unit square grid. In this paper we consider the Minimum Vertex Guard problem for this class of orthogonal polygons. As a step for the resolution
The Structure of Optimal Partitions of Orthogonal Polygons into Fat Rectangles
, 2003
"... Motivated by a VLSI masking problem, we explore partitions of an orthogonal polygon of n vertices into isothetic rectangles that maximize the shortest rectangle side over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat. ” We show that such partitions have a rich structure, more ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Motivated by a VLSI masking problem, we explore partitions of an orthogonal polygon of n vertices into isothetic rectangles that maximize the shortest rectangle side over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat. ” We show that such partitions have a rich structure, more
Results 1  10
of
223