Results 1  10
of
2,418
AreaPreserving Subdivision Schematization
"... Abstract. We describe an areapreserving subdivision schematization algorithm: the area of each region in the input equals the area of the corresponding region in the output. Our schematization is axisaligned, the final output is a rectilinear subdivision. We first describe how to convert a given ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. We describe an areapreserving subdivision schematization algorithm: the area of each region in the input equals the area of the corresponding region in the output. Our schematization is axisaligned, the final output is a rectilinear subdivision. We first describe how to convert a given
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
"... Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. In this paper we consider the dynamic vertical ray shooting problem, that is the task of maintaining a dynamic set S of n non intersecting horizontal line segments in the plane subject to a query that reports the first segment ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions. In this paper we consider the dynamic vertical ray shooting problem, that is the task of maintaining a dynamic set S of n non intersecting horizontal line segments in the plane subject to a query that reports the first
Optimal BSPs and Rectilinear Cartograms
 GIS
, 2006
"... A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a particular geographic variable, for example, population. We present an algorithm for constructing rectilinear cartograms (ea ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a particular geographic variable, for example, population. We present an algorithm for constructing rectilinear cartograms
On Rectilinear Link Distance
 Computational Geometry: Theory and Applications
, 1989
"... Given a simple polygon P without holes all of whose edges are axisparallel, a rectilinear path in P is a path that consists of axisparallel segments only and does not cross any edge of P. The length of such a path is defined as the number of segments it consists of and the rectilinear link distanc ..."
Abstract
 Add to MetaCart
Given a simple polygon P without holes all of whose edges are axisparallel, a rectilinear path in P is a path that consists of axisparallel segments only and does not cross any edge of P. The length of such a path is defined as the number of segments it consists of and the rectilinear link
Two and ThreeDimensional Point Location in Rectangular Subdivision
 Journal of Algorithms
, 1991
"... We apply van Emde Boastype stratified trees to point location problems in rectangular subdivisions in 2 and 3 dimensions. In a subdivision with n rectangles having integer coordinates from [1, U], we locate an integer query point in O((loglogU) ) query time using O(n) space when d _ 2 or O(n log ..."
Abstract
 Add to MetaCart
(n log log U) space when d = 3. Applications and extensions of this 'Txed universe" approach include point location using logarithmic time and linear space in rectilinear subdivisions having arbitrary coordinates, point location in coriented polygons or fat triangles in the plane, point
Two and ThreeDimensional Point Location in Rectangular Subdivisions
 Journal of Algorithms
, 1995
"... We apply van Emde Boastype stratified trees to point location problems in rectangular subdivisions in 2 and 3 dimensions. In a subdivision with n rectangles having integer coordinates from [0; U \Gamma 1], we locate an integer query point in O((log log U ) d ) query time using O(n) space when d ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
2 or O(n log log U ) space when d = 3. Applications and extensions of this "fixed universe" approach include spatial point location using logarithmic time and linear space in rectilinear subdivisions having arbitrary coordinates, point location in coriented polygons or fat triangles
kLink Rectilinear Shortest Paths Among Rectilinear Obstacles in the Plane
"... We present an algorithm for computing klink rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra ” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log 2 n) and space O(kn ..."
Abstract
 Add to MetaCart
We present an algorithm for computing klink rectilinear shortest paths among rectilinear obstacles in the plane. We extend the “continuous Dijkstra ” paradigm to store the link distance information associated with each propagating “wavefront”. Our algorithm runs in time O(kn log 2 n) and space O
Compact Rectilinear Grids for the Ray Tracing of Irregular Scenes
 WSCG'2011
, 2011
"... The regular grid spatial subdivision on the left provides a less well balanced triangle distribution per cell than the rectilinear grid structure on the right. Both spatial partitioning grids feature a similar resolution. Regular grid spatial subdivision is frequently used for fast ray tracing of sc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The regular grid spatial subdivision on the left provides a less well balanced triangle distribution per cell than the rectilinear grid structure on the right. Both spatial partitioning grids feature a similar resolution. Regular grid spatial subdivision is frequently used for fast ray tracing
Ramified rectilinear polygons: coordinatization by dendrons, in preparation
, 2009
"... Abstract. Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic l1metric is thus inherited from the product of the two finite dendrons via an isometric embedding. Th ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Abstract. Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons. The intrinsic l1metric is thus inherited from the product of the two finite dendrons via an isometric embedding
Rectilinear texture warping for fast adaptive shadow mapping
 In Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games, I3D
"... Figure 1: Column 1: A conventional shadow map at 2,048×2,048 used to render the scene at 1080p (row 1) along with 2 zoomed regions (rows 2 and 3) in 3.3 ms. Column 2: The Rectilinear Texture Warping (RTW) shadow map at 512×512 (4.2 ms, tessellation disabled, maximum effective resolution (MER) 2,861× ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Figure 1: Column 1: A conventional shadow map at 2,048×2,048 used to render the scene at 1080p (row 1) along with 2 zoomed regions (rows 2 and 3) in 3.3 ms. Column 2: The Rectilinear Texture Warping (RTW) shadow map at 512×512 (4.2 ms, tessellation disabled, maximum effective resolution (MER) 2
Results 1  10
of
2,418