Results 1  10
of
240,934
On Piercing Sets of AxisParallel Rectangles and Rings
"... . We consider the ppiercing problem for axisparallel rectangles. We are given a collection of axisparallel rectangles in the plane, and wish to determine whether there exists a set of p points whose union intersects all the given rectangles. We present efficient algorithms for finding a piercing ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. We consider the ppiercing problem for axisparallel rectangles. We are given a collection of axisparallel rectangles in the plane, and wish to determine whether there exists a set of p points whose union intersects all the given rectangles. We present efficient algorithms for finding a piercing
Solving the multipleinstance problem with axisparallel rectangles
 Artificial Intelligence
, 1997
"... ..."
Smallsize εNets for AxisParallel Rectangles and Boxes (Extended Abstract)
, 2009
"... We show the existence of εnets of size O ` ´ 1 1 log log for ε ε planar point sets and axisparallel rectangular ranges. The same bound holds for points in the plane with “fat” triangular ranges, and for point sets in R 3 and axisparallel boxes; these are the first known nontrivial bounds for the ..."
Abstract

Cited by 17 (7 self)
 Add to MetaCart
We show the existence of εnets of size O ` ´ 1 1 log log for ε ε planar point sets and axisparallel rectangular ranges. The same bound holds for points in the plane with “fat” triangular ranges, and for point sets in R 3 and axisparallel boxes; these are the first known nontrivial bounds
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
casting algorithms because the latter must perform analytic geometry calculations (e.g. intersecting rays with axisaligned boxes). The new scanlineorder algorithm simply streams through the volume and the image in storage order. We describe variants of the algorithm for both parallel and perspective
A note about weak εnets for axisparallel boxes
 in dspace, Information Processing Letters 110
, 2010
"... We show the existence of weak εnets of size O (1/ε log log (1/ε)) for point sets and axisparallel boxes in Rd, for d ≥ 4. Our analysis uses a nontrivial variant of the recent technique of Aronov et al. [2] that yields (strong) εnets, whose size have the above asymptotic bound, for d = 2, 3. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We show the existence of weak εnets of size O (1/ε log log (1/ε)) for point sets and axisparallel boxes in Rd, for d ≥ 4. Our analysis uses a nontrivial variant of the recent technique of Aronov et al. [2] that yields (strong) εnets, whose size have the above asymptotic bound, for d = 2, 3.
Weak εnets for axisparallel boxes in dspace
, 2009
"... In this note we show the existence of weak εnets of size O (1/ε loglog (1/ε)) for point sets and axisparallel boxes in R d. Our analysis uses a nontrivial variant for the recent technique of Aronov et al. [AES09] that yields (strong) εnets, whose size have the above asymptotic bound, for d = 2, ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this note we show the existence of weak εnets of size O (1/ε loglog (1/ε)) for point sets and axisparallel boxes in R d. Our analysis uses a nontrivial variant for the recent technique of Aronov et al. [AES09] that yields (strong) εnets, whose size have the above asymptotic bound, for d = 2
Sequence Logos: A New Way to Display Consensus Sequences
 Nucleic Acids Res
, 1990
"... INTRODUCTION A logo is "a single piece of type bearing two or more usually separate elements" [1]. In this paper, we use logos to display aligned sets of sequences. Sequence logos concentrate the following information into a single graphic [2]: 1. The general consensus of the sequences. ..."
Abstract

Cited by 638 (27 self)
 Add to MetaCart
. National Cancer Institute, Frederick Cancer Research and Development Center, Laboratory of Mathematical Biology, P. O. Box B, Frederick, MD 21701. Internet addresses: toms@ncifcrf.gov and stephens@ncifcrf.gov. y corresponding author 1 2. The order of predominance of the residues at every position. 3
The Lumigraph
 In Proceedings of SIGGRAPH 96
, 1996
"... This paper discusses a new method for capturing the complete appearanceof both synthetic and real world objects and scenes, representing this information, and then using this representation to render images of the object from new camera positions. Unlike the shape capture process traditionally used ..."
Abstract

Cited by 1034 (43 self)
 Add to MetaCart
This paper discusses a new method for capturing the complete appearanceof both synthetic and real world objects and scenes, representing this information, and then using this representation to render images of the object from new camera positions. Unlike the shape capture process traditionally used in computer vision and the rendering process traditionally used in computer graphics, our approach does not rely on geometric representations. Instead we sample and reconstruct a 4D function, which we call a Lumigraph. The Lumigraph is a subset of the complete plenoptic function that describes the flow of light at all positions in all directions. With the Lumigraph, new images of the object can be generated very quickly, independent of the geometric or illumination complexity of the scene or object. The paper discusses a complete working system including the capture of samples, the construction of the Lumigraph, and the subsequent rendering of images from this new representation. 1
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 562 (15 self)
 Add to MetaCart
A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding
A Framework for Dynamic Graph Drawing
 CONGRESSUS NUMERANTIUM
, 1992
"... Drawing graphs is an important problem that combines flavors of computational geometry and graph theory. Applications can be found in a variety of areas including circuit layout, network management, software engineering, and graphics. The main contributions of this paper can be summarized as follows ..."
Abstract

Cited by 627 (44 self)
 Add to MetaCart
as follows: ffl We devise a model for dynamic graph algorithms, based on performing queries and updates on an implicit representation of the drawing, and we show its applications. ffl We present several efficient dynamic drawing algorithms for trees, seriesparallel digraphs, planar stdigraphs, and planar
Results 1  10
of
240,934