A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
High-performance quadtree constructions on large-scale geospatial rasters using GPGPU parallel primitives
2013
International Journal of Geographical Information Science
Preserved Fulltext
In this study, we have proposed a parallel primitive based approach to quadtree construction by transforming a multidimensional geospatial computing problem into chaining a set of generic parallel primitives ...
that are designed for one dimensional arrays. ...
After the Z-order transformation, the 2D geospatial computing problem is converted into a 1D data processing problem with geospatial semantics embedded. ...
doi:10.1080/13658816.2013.828840
fatcat:qlmvaqh5szddllqyjf34xzboya
Data-Parallel Spatial Join Algorithms
1994
1994 International Conference on Parallel Processing Vol. 3
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are p r esented. ...
Parallel algorithms for map intersection and a spatial range query are described. ...
Data-Parallel PMR Quadtree The algorithm for building a parallel PMR quadtree proceeds as follows. ...
doi:10.1109/icpp.1994.82
dblp:conf/icpp/HoelS94
fatcat:d7pnmb7bljfapicqp6xzgazy2e
Surface intersection using parallelism
1994
Computer Aided Geometric Design
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate a parallel approach to the surface intersection problem that shows, both theoretically and empirically, that with parallelism we can achieve both speed and precision simultaneously ...
We then design two tolerance-based parallel subdivision algorithms, a macro-subdivision algorithm designed for MIMD shared memory machines and a lookahead-subdivision algorithm for pipelined MIMD machines ...
For small d, the above equation is satisfied, since the ratio N (d )/N ( 1) is much smaller than Cf=, SDV(I'). ...
doi:10.1016/0167-8396(94)90024-8
fatcat:vzkeebfsgjeffhul4tv447g6iq
Hierarchical data structures and algorithms for computer graphics. II. Applications
1988
IEEE Computer Graphics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Topics include use of the quadtree as a basis for hidden-surface algorithms, parallel and perspective projection methods to display a collection of objects represented by an octree, and the use of octrees ...
For scenes represented by raster octrees, the most common display technique is the parallel pr~jection.~'.~' The parallel projection of a raster octree is at its simplest when the viewplane is parallel ...
Worse, we need to solve these problems not just for a point on a patch, but for every point on the surface of the patch. ...
doi:10.1109/38.7750
fatcat:7zneqmt7frfvnlmgavfjsyzgkq
Factorization with morton-ordered quadtree matrices for memory re-use and parallelism
2003
Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '03
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straightforward parallel processing. ...
Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. ...
The time for both accessing the memory and communicating across processes must be reduced for efficient highperformance computing [1, 10, 17] . ...
doi:10.1145/781498.781525
dblp:conf/ppopp/FrensW03
fatcat:cfbi5lk45rcodn64z24roxdx2i
QR factorization with Morton-ordered quadtree matrices for memory re-use and parallelism
2003
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straightforward parallel processing. ...
Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. ...
The time for both accessing the memory and communicating across processes must be reduced for efficient highperformance computing [1, 10, 17] . ...
doi:10.1145/966049.781525
fatcat:kgiv23ofkvgrnfbynfhgurfiq4
ForestClaw: A parallel algorithm for patch-based adaptive mesh refinement on a forest of quadtrees
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We show weak and strong scalability results for scalar advection problems on two-dimensional manifold domains on 1 to 64Ki MPI processes, demonstrating neglible regridding overhead. ...
Dynamic grid refinement and parallel partitioning of the grids is done through the use of the highly scalable quadtree/octree library p4est. ...
The authors gratefully acknowledge the Gauß Centre for Supercomputing (GCS) for providing computing time through the John von Neumann Institute for Com- ...
arXiv:1703.03116v1
fatcat:oqrjj3l42rby3c6pmbdptczvqi
Hand shape recognition
2000
Optics and Laser Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The parallel grating will be distorted by the curvature shape of the hand and processed by image processing techniques for recognition. ...
This study uses a parallel grating to project onto the backside of a hand. ...
The distorted grating image will be grabbed by a CCD camera and processed by image processing techniques for recognition. ...
doi:10.1016/s0030-3992(99)00105-x
fatcat:mkoqec2jfbaflbpw4fwn53itwm
Parallel construction of quadtrees and quality triangulations
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. ...
Our algorithms take time O(log n) for point set input and O(log n log k) time for planar straight-line graphs, using O(n + k/ log n) processors, where n measures input size and k output size. ...
If the third case occurs, we split the segment in pieces and continue in parallel for each piece to the appropriate child of r. We process all edges in parallel, one level of T C at a time. ...
doi:10.1007/3-540-57155-8_247
fatcat:52u2vtkaxvczphwwwjkznqagsy
PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS
1999
International journal of computational geometry and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. ...
Our algorithms take time O(log n) for point set input and O(log n log k) time for planar straight-line graphs, using O(n + k/ log n) processors, where n measures input size and k output size. ...
If the third case occurs, we split the segment in pieces and continue in parallel for each piece to the appropriate child of r. We process all edges in parallel, one level of T C at a time. ...
doi:10.1142/s0218195999000303
fatcat:eqbue2lqfvhbzki5ywgp3dtk5e
The Efficient Algorithms for Constructing Enhanced Quadtrees Using MapReduce
2016
IEICE transactions on information and systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
MapReduce is considered as the de facto framework for storing and processing massive data due to its fascinating features: simplicity, flexibility, fault tolerance and scalability. ...
Furthermore, we present an effective algorithm for incremental update. ...
To alleviate this problem, we propose a parallel algorithm constructing quadtrees running on the MapReduce framework. ...
doi:10.1587/transinf.2015dap0005
fatcat:wxfmqao6vrbyrk2nipnmpoefza
MPI collective algorithm selection and quadtree encoding
2007
Parallel Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper, we focus on MPI collective algorithm selection process and explore the applicability of the quadtree encoding method to this problem. ...
These results indicate that quadtrees may be a feasible choice for both processing of the performance data and automatic decision function generation. ...
The major focus of future research will be comparing the quadtree-based decision functions, to the ones generated using run-length encoding and standard decision tree algorithms such as C4.5. ...
doi:10.1016/j.parco.2007.06.005
fatcat:i26v2t7li5gybdnpbps5r575hi
Parallel quadtree coding of large-scale raster geospatial data on GPGPUs
2011
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems - GIS '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
such data parallelism on massively parallel General Purpose Graphics Processing Units (GPGPUs) that require fine-grained parallelization. ...
A fine-grained parallelization scheme has been implemented using Nvidia CUDA. ...
Modern computing devices increasingly rely on parallel hardware architectures to meet the ever increasing demands of data processing power. ...
doi:10.1145/2093973.2094047
dblp:conf/gis/ZhangYG11
fatcat:zwr7obnjozcwvdmsbquydic5fm
Hardware-Based Adaptive Terrain Mesh Using Temporal Coherence for Real-Time Landscape Visualization
2019
Sustainability
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To solve this problem, we present a novel acceleration approach for generating an adaptive terrain mesh using temporal coherence. ...
Recently, three-dimensional (3D) terrain visualization programs, such as flight simulation, allow for interaction with various datasets to predict ecosystem influences in real time. ...
However, the recursive process while traversing the quadtree is not appropriate for GPU parallel processing. ...
doi:10.3390/su11072137
fatcat:rw47jwg4bfaa3avpt37z3miwqm
Planar decomposition for quadtree data structure
1986
Computer Vision Graphics and Image Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
This paper addresses the problem of planar tessellation which yields the quadtree data structure. ...
The quadtree data structure is extensively used in representing 2dimensional data in many applications like image processing, cartographic data processing. ...
The author wishes to thank Professors Jam& Patel, Narendra Ahuja, and finally, the reviewers for their criticism and suggestions which improved the readability and content of this paper. ...
doi:10.1016/s0734-189x(86)80040-8
fatcat:aqalkdpvcfhk3eqgzp7jkkdlwi
« Previous
Showing results 1 — 15 out of 4,154 results