Fischer A and Eidel B (2020). Error analysis for quadtree-type mesh coarsening algorithms adapted to pixelized heterogeneous microstructures, Computational Mechanics , 65 :6 , (1467-1491), Online publication date: 1-Jun-2020 .
Fevgas A and Bozanis P A spatial index for hybrid storage Proceedings of the 23rd International Database Applications & Engineering Symposium, (1-8)
Huang Y, Liu X, Krueger R, Santander T, Hu X, Leach K and Weimer W Distilling neural representations of data structure manipulation using fMRI and fNIRS Proceedings of the 41st International Conference on Software Engineering, (396-407)
García-García F, Corral A, Iribarne L, Vassilakopoulos M and Manolopoulos Y (2018). Efficient large-scale distance-based join queries in spatialhadoop, Geoinformatica , 22 :2 , (171-209), Online publication date: 1-Apr-2018 .
alik B, Mongus D, alik K and Luka N (2017). Boolean operations on rasterized shapes represented by chain codes using space filling curves, Journal of Visual Communication and Image Representation , 49 :C , (420-432), Online publication date: 1-Nov-2017 .
Roumelis G, Vassilakopoulos M, Corral A and Manolopoulos Y (2017). Efficient query processing on large spatial databases, Journal of Systems and Software , 132 :C , (165-185), Online publication date: 1-Oct-2017 .
Mostafiz M, Mahmud S, Hussain M, Ali M and Trajcevski G Class-based Conditional MaxRS Query in Spatial Data Streams Proceedings of the 29th International Conference on Scientific and Statistical Database Management, (1-12)
Samet H Sorting in space SIGGRAPH ASIA 2016 Courses, (1-42)Mirzadeh M, Guittet A, Burstedde C and Gibou F (2016). Parallel level-set methods on adaptive tree-based grids, Journal of Computational Physics , 322 :C , (345-364), Online publication date: 1-Oct-2016 .
Roumelis G, Vassilakopoulos M, Loukopoulos T, Corral A and Manolopoulos Y The xBR$$^+$$-tree Proceedings, Part I, of the 26th International Conference on Database and Expert Systems Applications - Volume 9261, (43-58)
(2015). A homogenized XFEM approach to simulate fatigue crack growth problems, Computers and Structures , 150 :C , (1-22), Online publication date: 1-Apr-2015 .
Koskela T and Vatjus-Anttila J (2015). Optimization Techniques for 3D Graphics Deployment on Mobile Devices, 3D Research , 6 :1 , (1-27), Online publication date: 1-Mar-2015 .
Szalay A From simulations to interactive numerical laboratories Proceedings of the 2014 Winter Simulation Conference, (875-886)
Khan A, Yanki P, Dimcheva B and Kossmann D Towards indexing functions Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, (241-252)
Wang Y, Yu H and Ma K Scalable parallel feature extraction and tracking for large time-varying 3D volume data Proceedings of the 13th Eurographics Symposium on Parallel Graphics and Visualization, (17-24)
Gibou F, Min C and Fedkiw R (2013). High Resolution Sharp Computational Methods for Elliptic and Parabolic Problems in Complex Geometries, Journal of Scientific Computing , 54 :2-3 , (369-413), Online publication date: 1-Feb-2013 .
Azari H, Cheng I and Basu A A time series 3D hierarchy for real-time dynamic point cloud interaction SIGGRAPH Asia 2012 Technical Briefs, (1-5)
Broutin N, Neininger R and Sulzbach H Partial match queries in random quadtrees Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (1056-1065)
Camata J and Coutinho A Poster Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion, (11-12)
Yamamoto F and Netto M Spatial representation and reasoning Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part II, (582-593)
Roumelis G, Vassilakopoulos M and Corral A Performance comparison of xBR-trees and R*-trees for single dataset spatial queries Proceedings of the 15th international conference on Advances in databases and information systems, (228-242)
Xia Y, Wu C, Kong Q, Shan Z and Kuang L A parallel fusion method for heterogeneous multi-sensor transportation data Proceedings of the 8th international conference on Modeling decisions for artificial intelligence, (31-42)
Vacavant A, Coeurjolly D and Tougne L (2011). Separable algorithms for distance transformations on irregular grids, Pattern Recognition Letters , 32 :9 , (1356-1364), Online publication date: 1-Jul-2011 .
Malerba D, Ceci M and Appice A Relational mining in spatial domains Proceedings of the 19th international conference on Foundations of intelligent systems, (16-24)
Samet H Sorting in space ACM SIGGRAPH ASIA 2010 Courses, (1-52)Jowkar M, Cruz R and Cela J Exploring a Novel Gathering Method for Finite Element Codes on the Cell/B.E. Architecture Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, (1-11)
Samet H (2010). Techniques for similarity searching in multimedia databases, Proceedings of the VLDB Endowment , 3 :1-2 , (1649-1650), Online publication date: 1-Sep-2010 .
Connor M and Kumar P Practical nearest neighbor search in the plane Proceedings of the 9th international conference on Experimental Algorithms, (501-512)
Samet H Multidimensional data structures for spatial applications Algorithms and theory of computation handbook, (6-6)
Färber M and Brüderlin B Multivariate root finding with search space decomposition and randomisation Proceedings of the 2009 ACM symposium on Applied Computing, (1142-1143)
Shen J, Tao D and Li X (2009). QUC-tree, IEEE Transactions on Multimedia , 11 :2 , (313-323), Online publication date: 1-Feb-2009 .
Wang S and Armstrong M (2009). A theoretical approach to the use of cyberinfrastructure in geographical analysis, International Journal of Geographical Information Science , 23 :2 , (169-193), Online publication date: 1-Feb-2009 .
Schlosser S, Ryan M, Taborda R, López J, O'Hallaron D and Bielak J Materialized community ground models for large-scale earthquake simulation Proceedings of the 2008 ACM/IEEE conference on Supercomputing, (1-12)
Bertino E, Thuraisingham B, Gertz M and Damiani M Security and privacy for geospatial data Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS, (6-19)
Samet H A sorting approach to indexing spatial data ACM SIGGRAPH 2008 classes, (1-15) Samet H Sorting in space ACM SIGGRAPH 2008 classes, (1-106)Jacox E and Samet H (2008). Metric space similarity joins, ACM Transactions on Database Systems , 33 :2 , (1-38), Online publication date: 1-Jun-2008 .
Vitter J (2008). Algorithms and data structures for external memory, Foundations and Trends® in Theoretical Computer Science , 2 :4 , (305-474), Online publication date: 1-Jan-2008 .
Aref W Pipelined spatial join processing for quadtree-based indexes Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems, (1-4)
El-Far N, Georganas N and Saddik A Collision Detection and Force Response in Highly-Detailed Point-Based Hapto-Visual Virtual Environments Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications, (15-22)
Min C and Gibou F (2007). Geometric integration over irregular domains with application to level-set methods, Journal of Computational Physics , 226 :2 , (1432-1443), Online publication date: 1-Oct-2007 .
Hildum D and Smith S Constructing conflict-free schedules in space and time Proceedings of the Seventeenth International Conference on International Conference on Automated Planning and Scheduling, (184-191)
Samet H Spatital data structures ACM SIGGRAPH 2007 courses, (1-es) Agarwala A Efficient gradient-domain compositing using quadtrees ACM SIGGRAPH 2007 papers, (94-es)Agarwala A (2007). Efficient gradient-domain compositing using quadtrees, ACM Transactions on Graphics , 26 :3 , (94-es), Online publication date: 29-Jul-2007 .
Chern H, Fuchs M and Hwang H (2007). Phase changes in random point quadtrees, ACM Transactions on Algorithms , 3 :2 , (12-es), Online publication date: 1-May-2007 .
Hambrusch S, Liu C, Aref W and Prabhakar S (2007). Efficient query execution on broadcasted index tree structures, Data & Knowledge Engineering , 60 :3 , (511-529), Online publication date: 1-Mar-2007 .
Min C and Gibou F (2006). A second order accurate projection method for the incompressible Navier-Stokes equations on non-graded adaptive grids, Journal of Computational Physics , 219 :2 , (912-929), Online publication date: 1-Dec-2006 .
Tu T, Yu H, Ramirez-Guzman L, Bielak J, Ghattas O, Ma K and O'Hallaron D From mesh generation to scientific visualization Proceedings of the 2006 ACM/IEEE conference on Supercomputing, (91-es)
Oh K, Ki H and Lee C Pyramidal displacement mapping Proceedings of the ACM symposium on Virtual reality software and technology, (75-82)
Min C, Gibou F and Ceniceros H (2006). A supra-convergent finite difference scheme for the variable coefficient Poisson equation on non-graded grids, Journal of Computational Physics , 218 :1 , (123-140), Online publication date: 10-Oct-2006 .
Martínez-Usó A, Pla F and García-Sevilla P Unsupervised image segmentation using a hierarchical clustering selection process Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition, (799-807)
Pérez M, Benavent X and Olanda R Efficient coding of quadtree nodes Proceedings of the 6th international conference on Computational Science - Volume Part III, (13-16)
Wong W, Shih F and Su T (2006). Thinning algorithms based on quadtree and octree representations, Information Sciences: an International Journal , 176 :10 , (1379-1394), Online publication date: 1-May-2006 .
Cecil T, Osher S and Qian J (2006). Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension, Journal of Computational Physics , 213 :2 , (458-473), Online publication date: 10-Apr-2006 .
Zhang J Spatio-temporal aggregates over streaming geospatial image data Proceedings of the 2006 international conference on Current Trends in Database Technology, (32-43)
Flajolet P The ubiquitous digital tree Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science, (1-22)
Edwardes A, Burghardt D, Dias E, Purves R and Weibel R Geo-Enabling spatially relevant data for mobile information use and visualisation Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems, (78-92)
Dean D Measuring arrangement similarity between thematic raster databases using a quadtree-based approach Proceedings of the First international conference on GeoSpatial Semantics, (120-136)
TU T, O'HALLARON D and GHATTAS O Scalable Parallel Octree Meshing for TeraScale Applications Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Hel-Or Y and Hel-Or H (2005). Real-Time Pattern Matching Using Projection Kernels, IEEE Transactions on Pattern Analysis and Machine Intelligence , 27 :9 , (1430-1445), Online publication date: 1-Sep-2005 .
Wahl E and Hirzinger G A method for fast search of variable regions on dynamic 3D point clouds Proceedings of the 27th DAGM conference on Pattern Recognition, (208-215)
Chaudhary A and Goodrich M Balanced aspect ratio trees revisited Proceedings of the 9th international conference on Algorithms and Data Structures, (73-85)
Eppstein D, Goodrich M and Sun J The skip quadtree Proceedings of the twenty-first annual symposium on Computational geometry, (296-305)
Samet H (2004). Decoupling partitioning and grouping, ACM Transactions on Database Systems , 29 :4 , (789-830), Online publication date: 12-Dec-2004 .
Samet H Indexing issues in supporting similarity searching Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II, (463-470)
Han Q and Bertolotto M A multi-level data structure for vector maps Proceedings of the 12th annual ACM international workshop on Geographic information systems, (214-221)
Tu T and O'Hallaron D A Computational Database System for Generatinn Unstructured Hexahedral Meshes with Billions of Elements Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Lopez J, O'Hallaron D and Tu T Big Wins with Small Application-Aware Caches Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Pérez M, Fernández M and Olanda R Non-interleaved quadtree node codification Proceedings of the Third international conference on Advances in Information Systems, (203-212)
Cignoni P, Ganovelli F, Gobbetti E, Marton F, Ponchio F and Scopigno R Adaptive tetrapuzzles ACM SIGGRAPH 2004 Papers, (796-803)
Cignoni P, Ganovelli F, Gobbetti E, Marton F, Ponchio F and Scopigno R (2004). Adaptive tetrapuzzles, ACM Transactions on Graphics , 23 :3 , (796-803), Online publication date: 1-Aug-2004 .
Govindarajan S, Dietze M, Agarwal P and Clark J A scalable simulator for forest dynamics Proceedings of the twentieth annual symposium on Computational geometry, (106-115)
Battiato S, Gallo G and Messina G SVG rendering of real images using data dependent triangulation Proceedings of the 20th Spring Conference on Computer Graphics, (185-192)
Tsai Y, Chung K and Chen W (2004). A Strip-Splitting-Based Optimal Algorithm for Decomposing a Query Window into Maximal Quadtree Blocks, IEEE Transactions on Knowledge and Data Engineering , 16 :4 , (519-523), Online publication date: 1-Apr-2004 .
Sood N and Wieland F Simulation of airports/aviation systems Proceedings of the 35th conference on Winter simulation: driving innovation, (1650-1655)
Cignoni P, Ganovelli F, Gobbetti E, Marton F, Ponchio F and Scopigno R Planet-Sized Batched Dynamic Adaptive Meshes (P-BDAM) Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Yemez Y and Schmitt F (2003). Multilevel Representation and Transmission of Real Objects with Progressive Octree Particles, IEEE Transactions on Visualization and Computer Graphics , 9 :4 , (551-569), Online publication date: 1-Oct-2003 .
Hoel E and Samet H (2003). Data-parallel polygonization, Parallel Computing , 29 :10 , (1381-1401), Online publication date: 1-Oct-2003 .
Wang S and Armstrong M (2003). A quadtree approach to domain decomposition for spatial interpolation in grid computing environments, Parallel Computing , 29 :10 , (1481-1504), Online publication date: 1-Oct-2003 .
Popinet S (2003). Gerris, Journal of Computational Physics , 190 :2 , (572-600), Online publication date: 20-Sep-2003 .
Liu X (2003). On performance of quadrant-recursive spatial orders, Applied Mathematics and Computation , 141 :2-3 , (499-527), Online publication date: 5-Sep-2003 .
Mirolo C and Pagello E (2003). A New Cell-subdivision Approach to Plan Free Translations in Cluttered Environments, Journal of Intelligent and Robotic Systems , 38 :1 , (5-30), Online publication date: 1-Sep-2003 .
Wyse J (2003). Supporting m-commerce transactions incorporating locational attributes: an evaluation of the comparative performance of a location-aware method of locations repository management, International Journal of Mobile Communications , 1 :1-2 , (119-147), Online publication date: 1-Jul-2003 .
Balmelli L, Liebling T and Vetterli M (2003). Computational analysis of mesh simplification using global error, Computational Geometry: Theory and Applications , 25 :3 , (171-196), Online publication date: 1-Jul-2003 .
Wissink A, Hysom D and Hornung R Enhancing scalability of parallel structured AMR calculations Proceedings of the 17th annual international conference on Supercomputing, (336-347)
Ashida K and Badler N Feature preserving manifold mesh from an octree Proceedings of the eighth ACM symposium on Solid modeling and applications, (292-297)
Brabec F, Samet H and Yilmaz C VASCO Proceedings of the nineteenth annual symposium on Computational geometry, (374-375)
Aronov B, Bronnimann H, Chang A and Chiang Y Cost-driven octree construction schemes Proceedings of the nineteenth annual symposium on Computational geometry, (227-236)
Boada I, Coll N and Sellarès J Dynamically maintaining a hierarchical planar Voronoi diagram approximation Proceedings of the 2003 international conference on Computational science and its applications: PartIII, (836-846)
Hjaltason G and Samet H (2003). Properties of Embedding Methods for Similarity Searching in Metric Spaces, IEEE Transactions on Pattern Analysis and Machine Intelligence , 25 :5 , (530-549), Online publication date: 1-May-2003 .
Agarwal P, Arge L and Erickson J (2003). Indexing moving points, Journal of Computer and System Sciences , 66 :1 , (207-243), Online publication date: 1-Feb-2003 .
Czumaj A, Ergün F, Fortnow L, Magen A, Newman I, Rubinfeld R and Sohler C Sublinear-time approximation of Euclidean minimum spanning tree Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (813-822)
Carnes D and Wieland F Advanced aviation concepts via simulation Proceedings of the 34th conference on Winter simulation: exploring new frontiers, (1219-1225)
Arya S (2002). Binary space partitions for axis-paralles line segments, Information Processing Letters , 84 :4 , (201-206), Online publication date: 30-Nov-2002 .
Wang X, Bu J and Chen C Achieving undo in bitmap-based collaborative graphics editing systems Proceedings of the 2002 ACM conference on Computer supported cooperative work, (68-76)
De Floriani L and Magillo P Regular and irregular multi-resolution terrain models Proceedings of the 10th ACM international symposium on Advances in geographic information systems, (143-148)
Córcoles J and González P Analysis of different approaches for storing GML documents Proceedings of the 10th ACM international symposium on Advances in geographic information systems, (11-16)
Tanin E, Brabec F and Samet H Remote access to large spatial databases Proceedings of the 10th ACM international symposium on Advances in geographic information systems, (5-10)
Kanda T and Sugihara K (2002). Comparison of various trees for nearest-point search with/without the Voronoi diagram, Information Processing Letters , 84 :1 , (17-22), Online publication date: 16-Oct-2002 .
DeBry D, Gibbs J, Petty D and Robins N Painting and rendering textures on unparameterized models Proceedings of the 29th annual conference on Computer graphics and interactive techniques, (763-768)
Lindstrom P and Pascucci V (2002). Terrain Simplification Simplified, IEEE Transactions on Visualization and Computer Graphics , 8 :3 , (239-254), Online publication date: 1-Jul-2002 .
Aronov B, Brönnimann H, Chang A and Chiang Y Cost prediction for ray shooting Proceedings of the eighteenth annual symposium on Computational geometry, (293-302)
Samet H and Brabec F Remote thin-client access to spatial database systems Proceedings of the 2002 annual national conference on Digital government research, (1-8)
Balmelli L, Vetterli M and Liebling T (2002). Mesh optimization using global error with application to geometry simplification, Graphical Models , 64 :3-4 , (230-257), Online publication date: 1-May-2002 .
Boada I and Navazo I The Hybrid Octree Proceedings of the International Conference on Computational Science-Part II, (121-130)
Ding Q, Khan M, Roy A and Perrizo W The P-tree algebra Proceedings of the 2002 ACM symposium on Applied computing, (426-431)
Berman P, DasGupta B and Muthukrishnan S Slice and dice Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (455-464)
Günther O Data management in environmental information systems Handbook of massive data sets, (981-1091)
Vitter J External memory algorithms Handbook of massive data sets, (359-416) Arge L External memory data structures Handbook of massive data sets, (313-357)Belussi A, Bertino E and Catania B (2002). Using spatial data access structures for filtering nearest neighbor queries, Data & Knowledge Engineering , 40 :1 , (1-31), Online publication date: 1-Jan-2002 .
Aref W and Ilyas I (2001). SP-GiST, Journal of Intelligent Information Systems , 17 :2-3 , (215-240), Online publication date: 2-Dec-2001 .
Bertolotto M and Egenhofer M (2001). Progressive Transmission of Vector Map Data over the World Wide Web, Geoinformatica , 5 :4 , (345-373), Online publication date: 1-Dec-2001 .
Chen B and Nguyen M POP Proceedings of the conference on Visualization '01, (45-52)Aboulnaga A and Aref W (2001). Window Query Processing in Linear Quadtrees, Distributed and Parallel Databases , 10 :2 , (111-126), Online publication date: 1-Sep-2001 .
Perrizo W, Ding Q, Ding Q and Roy A Deriving High Confidence Rules from Spatial Data Using Peano Count Trees Proceedings of the Second International Conference on Advances in Web-Age Information Management, (91-102)
Vitter J (2001). External memory algorithms and data structures, ACM Computing Surveys , 33 :2 , (209-271), Online publication date: 1-Jun-2001 .
Mellor-Crummey J, Whalley D and Kennedy K (2001). Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings, International Journal of Parallel Programming , 29 :3 , (217-247), Online publication date: 1-Jun-2001 .
Wieland F, Carnes D and Schultz G Using quad trees for parallelizing conflict detection in a sequential simulation Proceedings of the fifteenth workshop on Parallel and distributed simulation, (117-123)
Garland M, Willmott A and Heckbert P Hierarchical face clustering on polygonal surfaces Proceedings of the 2001 symposium on Interactive 3D graphics, (49-58)
Schwanecke U and Kobbelt L Approximate envelope reconstruction for moving solids Mathematical Methods for Curves and Surfaces, (455-466)
Guéziec A (2001). 'Meshsweeper', IEEE Transactions on Visualization and Computer Graphics , 7 :1 , (47-61), Online publication date: 1-Jan-2001 .
Hambrusch S and Liu C Data replication for external searching in static tree structures Proceedings of the ninth international conference on Information and knowledge management, (360-367)
Floriani L, Magillo P and Puppo E (2000). VARIANT, Geoinformatica , 4 :3 , (287-315), Online publication date: 1-Oct-2000 .
Kriegel H, Pötke M and Seidl T Managing Intervals Efficiently in Object-Relational Databases Proceedings of the 26th International Conference on Very Large Data Bases, (407-418)
Rusinkiewicz S and Levoy M QSplat Proceedings of the 27th annual conference on Computer graphics and interactive techniques, (343-352)
Schaufler G, Dorsey J, Decoret X and Sillion F Conservative volumetric visibility with occluder fusion Proceedings of the 27th annual conference on Computer graphics and interactive techniques, (229-238)
Szalay A, Kunszt P, Thakar A, Gray J, Slutz D and Brunner R (2000). Designing and mining multi-terabyte astronomy archives, ACM SIGMOD Record , 29 :2 , (451-462), Online publication date: 1-Jun-2000 .
Szalay A, Kunszt P, Thakar A, Gray J, Slutz D and Brunner R Designing and mining multi-terabyte astronomy archives Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (451-462)
Klosowski J and Silva C (2000). The Prioritized-Layered Projection Algorithm for Visible Set Estimation, IEEE Transactions on Visualization and Computer Graphics , 6 :2 , (108-123), Online publication date: 1-Apr-2000 .
Badawy W and Aref W On local heuristics to speed up polygon-polygon intersection tests Proceedings of the 7th ACM international symposium on Advances in geographic information systems, (97-102)
Kang M, Servigne S, Li K and Laurini R Indexing field values in field oriented systems Proceedings of the eighth international conference on Information and knowledge management, (335-342)
Amir A, Efrat A, Indyk P and Samet H Efficient Regular Data Structures and Algorithms for Location and Proximity Problems Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Mellor-Crummey J, Whalley D and Kennedy K Improving memory hierarchy performance for irregular applications Proceedings of the 13th international conference on Supercomputing, (425-433)
Keim D Efficient geometry-based similarity search of 3D spatial databases Proceedings of the 1999 ACM SIGMOD international conference on Management of data, (419-430)
Acharya S, Poosala V and Ramaswamy S Selectivity estimation in spatial databases Proceedings of the 1999 ACM SIGMOD international conference on Management of data, (13-24)
Keim D (1999). Efficient geometry-based similarity search of 3D spatial databases, ACM SIGMOD Record , 28 :2 , (419-430), Online publication date: 1-Jun-1999 .
Acharya S, Poosala V and Ramaswamy S (1999). Selectivity estimation in spatial databases, ACM SIGMOD Record , 28 :2 , (13-24), Online publication date: 1-Jun-1999 .
Arge L, Samoladas V and Vitter J On two-dimensional indexability and optimal range search indexing Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (346-357)
Sevilgen F and Aluru S A unifying data structure for hierarchical methods Proceedings of the 1999 ACM/IEEE conference on Supercomputing, (24-es)
Fishwick P An architectural design for digital objects Proceedings of the 30th conference on Winter simulation, (359-366)
Tzouramanis T, Vassilakopoulos M and Manolopoulos Y Overlapping linear quadtrees Proceedings of the 6th ACM international symposium on Advances in geographic information systems, (1-7)
De Floriani L, Magillo P and Puppo E Efficient implementation of multi-triangulations Proceedings of the conference on Visualization '98, (43-50)
Crauser A, Ferragina P, Mehlhorn K, Meyer U and Ramos E Randomized external-memory algorithms for some geometric problems Proceedings of the fourteenth annual symposium on Computational geometry, (259-268)
Hjaltason G and Samet H (1998). Incremental distance join algorithms for spatial databases, ACM SIGMOD Record , 27 :2 , (237-248), Online publication date: 1-Jun-1998 .
Hjaltason G and Samet H Incremental distance join algorithms for spatial databases Proceedings of the 1998 ACM SIGMOD international conference on Management of data, (237-248)
Agarwal P, Arge L, Erickson J, Franciosa P and Vitter J Efficient searching with linear constraints Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (169-178)
Vitter J External memory algorithms Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (119-128)
Arge L, Procopiuc O, Ramaswamy S, Suel T and Vitter J Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (685-694)
Agarwal P, Arge L, Murali T, Varadarajan K and Vitter J I/O-efficient algorithms for contour-line extraction and planar graph blocking Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (117-126)
De Floriani L, Magillo P and Puppo E VARIANT—processing and visualizing terrains at variable resolution Proceedings of the 5th ACM international workshop on Advances in geographic information systems, (15-19)
Duchaineau M, Wolinsky M, Sigeti D, Miller M, Aldrich C and Mineev-Weinstein M ROAMing terrain Proceedings of the 8th conference on Visualization '97, (81-88)
Subramanian K and Naylor B (1997). Converting Discrete Images to Partitioning Trees, IEEE Transactions on Visualization and Computer Graphics , 3 :3 , (273-288), Online publication date: 1-Jul-1997 .
Chung K (1997). Efficient Parallel Manipulations of IBB Coded Imageson Meshes with Multiple Broadcasting, Journal of Mathematical Imaging and Vision , 7 :3 , (275-282), Online publication date: 1-Jun-1997 .
Jones L Building a registered volume database Proceedings of the 35th annual ACM Southeast Conference, (15-19)
Hambrusch S and Khokhar A Maintaining Spatial Data Sets in Distributed-Memory Machines Proceedings of the 11th International Symposium on Parallel Processing, (702-707)
Aref W and Samet H (1997). Efficient Window Block Retrieval in Quadtree-Based Spatial Databases, Geoinformatica , 1 :1 , (59-91), Online publication date: 1-Apr-1997 .
Goodrich M, Orletsky M and Ramaiyer K Methods for achieving fast query times in point location data structures Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, (757-766)
De Floriani L, Magillo P, Puppo E and Bertolotto M Variable resolution operators on a multiresolution terrain model Proceedings of the 4th ACM international workshop on Advances in geographic information systems, (121-128)
Finkelstein A, Jacobs C and Salesin D Multiresolution video Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, (281-290)
Vengroff D and Vitter J Efficient 3-D range searching in external memory Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing, (192-201)
Coorg S and Teller S Temporally coherent conservative visibility (extended abstract) Proceedings of the twelfth annual symposium on Computational geometry, (78-87)
Hoffmann C and Rossignac J (1996). A Road Map To Solid Modeling, IEEE Transactions on Visualization and Computer Graphics , 2 :1 , (3-10), Online publication date: 1-Mar-1996 .
Hambrusch S and Khokhar A (1996). C3, Journal of Parallel and Distributed Computing , 32 :2 , (139-154), Online publication date: 1-Feb-1996 .
Menon J and Voelcker H On the completeness and conversion of ray representations of arbitrary solids Proceedings of the third ACM symposium on Solid modeling and applications, (175-286)
Bertolotto M, De Floriani L and Marzano P Pyramidal simplicial complexes Proceedings of the third ACM symposium on Solid modeling and applications, (153-162)
Whang K, Song J, Chang J, Kim J, Cho W, Park C and Song I (1995). Octree-R, IEEE Transactions on Visualization and Computer Graphics , 1 :4 , (343-349), Online publication date: 1-Dec-1995 .
De Floriani L and Puppo E (1995). Hierarchical triangulation for multiresolution surface description, ACM Transactions on Graphics , 14 :4 , (363-411), Online publication date: 1-Oct-1995 .
Ramaswamy S and Kanellakis P OODB indexing by class-division Proceedings of the 1995 ACM SIGMOD international conference on Management of data, (139-150)
Roussopoulos N, Kelley S and Vincent F Nearest neighbor queries Proceedings of the 1995 ACM SIGMOD international conference on Management of data, (71-79)
Ramaswamy S and Kanellakis P (1995). OODB indexing by class-division, ACM SIGMOD Record , 24 :2 , (139-150), Online publication date: 22-May-1995 .
Roussopoulos N, Kelley S and Vincent F (1995). Nearest neighbor queries, ACM SIGMOD Record , 24 :2 , (71-79), Online publication date: 22-May-1995 .
Kanellakis P Constraint programming and database languages Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (46-53)
Subramanian S and Ramaswamy S The P-range tree Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, (378-387)
Kanellakis P (1994). Database querying and constraint programming, ACM SIGACT News , 25 :4 , (22-87), Online publication date: 1-Dec-1994 .
Aref W and Samet H Hashing by proximity to process duplicates in spatial databases Proceedings of the third international conference on Information and knowledge management, (347-354)
Smith J and Chang S Quad-tree segmentation for texture-based image query Proceedings of the second ACM international conference on Multimedia, (279-286)
Hoel E and Samet H Performance of Data-Parallel Spatial Operations Proceedings of the 20th International Conference on Very Large Data Bases, (156-167)
Hummel J, Hendren L and Nicolau A A general data dependence test for dynamic, pointer-based data structures Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (218-229)
Hummel J, Hendren L and Nicolau A (1994). A general data dependence test for dynamic, pointer-based data structures, ACM SIGPLAN Notices , 29 :6 , (218-229), Online publication date: 1-Jun-1994 .
Ramaswamy S and Subramanian S Path caching (extended abstract) Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (25-35)
Faloutsos C and Kamel I Beyond uniformity and independence Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (4-13)
Subramanian R and Adam N The design and implementation of an expert object-oriented geographic information system Proceedings of the second international conference on Information and knowledge management, (537-546)
Bieri H and Grimm F (1993). Approaching classical algorithms in APL2, ACM SIGAPL APL Quote Quad , 24 :1 , (33-40), Online publication date: 1-Sep-1993 .
Bieri H and Grimm F Approaching classical algorithms in APL2 Proceedings of the international conference on APL, (33-40)
Kanellakis P, Ramaswamy S, Vengroff D and Vitter J Indexing for data models with constraints and classes (extended abstract) Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (233-243)
Lavender D, Bowyer A, Davenport J, Wallis A and Woodwark J (1992). Voronoi Diagrams of Set-Theoretic solid Models, IEEE Computer Graphics and Applications , 12 :5 , (69-77), Online publication date: 1-Sep-1992 .
Hoppe H, DeRose T, Duchamp T, McDonald J and Stuetzle W (1992). Surface reconstruction from unorganized points, ACM SIGGRAPH Computer Graphics , 26 :2 , (71-78), Online publication date: 1-Jul-1992 .
Hoppe H, DeRose T, Duchamp T, McDonald J and Stuetzle W Surface reconstruction from unorganized points Proceedings of the 19th annual conference on Computer graphics and interactive techniques, (71-78)
Hoel E and Samet H A qualitative comparison study of data structures for large line segment databases Proceedings of the 1992 ACM SIGMOD international conference on Management of data, (205-214)
Hoel E and Samet H (1992). A qualitative comparison study of data structures for large line segment databases, ACM SIGMOD Record , 21 :2 , (205-214), Online publication date: 1-Jun-1992 .
Zand M, Farhat H and Saiedian H Persistent structures to store moving images Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's, (21-27)
Brunet P, Navazo I and Vinacua A Octree detection of closed compartments Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, (87-96)
Yacoob Y Displaying voxel-based objects according to their qualitative shape synthesis Proceedings of the 1st conference on Visualization '90, (51-58)
Von Herzen B, Barr A and Zatz H (1990). Geometric collisions for time-dependent parametric surfaces, ACM SIGGRAPH Computer Graphics , 24 :4 , (39-48), Online publication date: 1-Sep-1990 .
Von Herzen B, Barr A and Zatz H Geometric collisions for time-dependent parametric surfaces Proceedings of the 17th annual conference on Computer graphics and interactive techniques, (39-48)
Ang C, Samet H and Shaffer C (1990). A New Region Expansion for Quadtrees, IEEE Transactions on Pattern Analysis and Machine Intelligence , 12 :7 , (682-686), Online publication date: 1-Jul-1990 .
Aref W and Samet H Efficient processing of window queries in the pyramid data structure Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (265-272)
Hébert M, McNeill M, Shah B, Grimsdale R and Lister P MARTI Proceedings of the Fifth Eurographics conference on Advances in Computer Graphics Hardware: rendering, ray tracing and visualization systems, (69-83)
Reviewer: A. T. Campbell
This two-volume series is an effort to provide a guide to the study of hierarchical data structures. The topic has extensive influence on many fields, particularly computer graphics, image processing, and computational geometry. Hanan Samet is a well-established expert in the field, with dozens of publications to his name. As a computer graphics researcher, I eagerly anticipated the books' publication. A close examination of both volumes leads to one conclusion: the books are worthwhile. The integration of diverse material is notable. Comprehensive research results throughout the spectrum of science are drawn together seamlessly. Samet has done a thorough job of pulling together literature from a vast collection of conference proceedings and journals, both major and minor. The level of explanation is good. The descriptions of algorithms reflect an understanding of what is really going on. Even algorithms mentioned briefly are given a good essential description. The books include algorithms for such problems as proximity searching, efficient storage of image and volume data, constructive solid geometry, data structure conversion, hidden surface removal, and ray tracing. Pseudo-ALGOL code examples present detailed explanations of how to build and traverse many of the data structures. Ray tracing enthusiasts in particular will enjoy a detailed description of how to trace a path through an octree. There are, however, a few problems with the presentation. Despite the ambitious titles of the volumes, they contain nowhere near as much theory or practical advice as one might expect. Instead, the emphasis is on explaining literally everything at an understandable level. While this makes the books a wonderful introduction to spatial data structures, the reader will need additional guidance in choosing what techniques to actually use. The title of the first volume, The design and analysis of spatial data structures , obviously invites comparison with the classic text, The design and analysis of computer algorithms , by Aho, Hopcroft, and Ullman [1]. Samet's approach differs greatly from that of Aho et al., however. While he describes and discusses the data structures in detail, the analysis is not very formal. Theorems and proofs, as well as detailed algorithm analyses, are not much in evidence. A more appropriate title might be simply An introduction to spatial data structures . The second book covers basically every research result in hierarchical algorithms, major and minor. It is especially good at explaining techniques succinctly. The reader will find that the depth of explanation is not sufficient to help her or him implement the techniques, and will need to refer to the original papers, however. Additionally, I do not get a good feel for which results should actually be used. Samet never indicates whether a technique is commonly used in industry or never used because of its impracticality. The reader who expects a “cookbook” solution to a problem will be disappointed. The books are primarily of use for two purposes. First, they provide a good introduction to those aspects of computation geometry and image processing which are most likely to be of interest to a person working in graphics. Second, they provide a complete guidebook to the literature. I recommend that researchers and practitioners have these volumes on their reference shelves. Due to the sheer volume of material they present, however, I do not recommend them for use as course textbooks.
Become a reviewer for Computing Reviews.
The Medium Resolution Imaging Spectrometer (MERIS) Terrestrial Chlorophyll Index (MTCI), a standard level 2 European Space Agency (ESA) product, provides information on the chlorophyll content of vegetation (amount of chlorophyll per unit area of ground).
Daily 30m data were generated by combining MODIS and Landsat data.A temporal validation method for synthetic daily 30m data was proposed and tested.Vegetation phenology was monitored using synthetic daily Landsat NDVI data.Phenology was monitored at 30m .
The selection of the optimal band combination for the estimation of specific crop variables is a key aspect in order to obtain reliable estimation of in-field variability from multi-and hyperspectral remote-sensing data. The selection of the bands is .
