Results 1  10
of
193
Hierarchical Polygon Tiling with Coverage Masks
"... We present a novel polygon tiling algorithm in which recursive subdivision of image space is driven by coverage masks that classify a convex polygon as inside, outside, or intersecting cells in an image hierarchy. This approach permits Warnockstyle subdivision with its logarithmic search properties ..."
Abstract
 Add to MetaCart
We present a novel polygon tiling algorithm in which recursive subdivision of image space is driven by coverage masks that classify a convex polygon as inside, outside, or intersecting cells in an image hierarchy. This approach permits Warnockstyle subdivision with its logarithmic search
Hierarchical Polygon Tiling with Coverage Masks
"... We present a novel polygon tiling algorithm in which recursive subdivision of image space is driven by coverage masks that classify a convex polygon as inside, outside, or intersecting cells in an image hierarchy. This approach permits Warnockstyle subdivision with its logarithmic search properties ..."
Abstract
 Add to MetaCart
We present a novel polygon tiling algorithm in which recursive subdivision of image space is driven by coverage masks that classify a convex polygon as inside, outside, or intersecting cells in an image hierarchy. This approach permits Warnockstyle subdivision with its logarithmic search
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 445 (3 self)
 Add to MetaCart
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also
Tiling a Polygon with Rectangles
 Proc. 33rd Symp. Foundations of Computer Science
, 1992
"... We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). We present a linear time algorithm for deciding if a polygon can be tiled with 1 \Theta m and k \Theta 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem whe ..."
Abstract

Cited by 35 (4 self)
 Add to MetaCart
We study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). We present a linear time algorithm for deciding if a polygon can be tiled with 1 \Theta m and k \Theta 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem
On visible surface generation by a priori tree structures
 Computer Graphics
, 1980
"... This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications t ..."
Abstract

Cited by 370 (6 self)
 Add to MetaCart
the environment to be displayed consists of polygons many of whose relative geometric relations are static, we attempt to capitalize on this by pre processing tile environment,s database so as to decrease the runtime computations required to generate a scene. This preprocessing is based on generating a &
Tiling polygons with lattice triangles
, 2009
"... Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the xaxis, we look at the problem of the location of the vertices for a tiling of the polygon using lattice triangles (i.e., triangles which are congruent to a triangle with the coordinates of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a simple polygon with rational coordinates having one vertex at the origin and an adjacent vertex on the xaxis, we look at the problem of the location of the vertices for a tiling of the polygon using lattice triangles (i.e., triangles which are congruent to a triangle with the coordinates
Tiling with Regular Star Polygons
, 2004
"... The Archimedean tilings (Figure 1) and polyhedra will be familiar to many readers. They have the property that the tiles of the tiling, or the faces of the polyhedron, are regular polygons, and that the vertices form a single orbit under the symmetries of the tiling or polyhedron. (Grünbaum and Shep ..."
Abstract
 Add to MetaCart
The Archimedean tilings (Figure 1) and polyhedra will be familiar to many readers. They have the property that the tiles of the tiling, or the faces of the polyhedron, are regular polygons, and that the vertices form a single orbit under the symmetries of the tiling or polyhedron. (Grünbaum
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
PSF Tiles Polygon A
"... Ray tracing dynamically changing scenes with unstructured motion has long been a problem for raytraversal acceleration schemes. When polygons are transformed arbitrarily, the cost of updating traditional spatial datastructures can be quite high [TL03][IW03]. We propose a ray traversal scheme that ..."
Abstract
 Add to MetaCart
the smallest bounding cuboid that encloses the scene, and divide the bottom face (parallel to the XYplane) into NxN 2D square tiles. Each tile can be considered as one end of a 3D beam parallel to the Zaxis that intersects a number of polygons. The tiling is represented as a 2D array, where each array el
Results 1  10
of
193