Spatial Queries in the Presence of Obstacles

No abstract is available for this paper.

• Publication year

  2004

• Venue

  International Conference on Extending Database Technology

• Publication date

  2004-03-14

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-540-24741-8_22
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Computational Geometry

  2018cited by this paper
• Visibility of disjoint polygons

  2005cited by this paper
• Query Processing in Spatial Network Databases

  2003cited by this paper
• Fast spatial clustering with different metrics and in the presence of obstacles

  2001cited by this paper
• Spatial clustering in the presence of obstacles

  2001cited by this paper
• Closest pair queries in spatial databases

  2000cited by this paper
• Distance browsing in spatial databases

  1999influential reference
• Incremental distance join algorithms for spatial databases

  1998cited by this paper
• Topologically sweeping visibility complexes via pseudotriangulations

  1996cited by this paper
• Minimal Tangent Visibility Graphs

  1996cited by this paper
• Pseudo-triangulations: theory and applications

  1996cited by this paper
• Computing the visibility graph via pseudo-triangulations

  1995cited by this paper
• Topologically sweeping the visibility complex of polygonal scenes

  1995cited by this paper
• Efficient processing of spatial joins using R-trees

  1993influential reference
• An Output-Sensitive Algorithm for Computing Visibility Graphs

  1991cited by this paper
• The R*-tree: an efficient and robust access method for points and rectangles

  1990cited by this paper
• The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

  1987cited by this paper
• Expert database systems

  1987cited by this paper
• Heuristic search in database systems

  1986cited by this paper
• On shortest paths in polyhedral spaces

  1986influential reference
• Constructing the Visibility Graph for n-Line Segments in O(n²) Time

  1985cited by this paper
• Heuristic Search in Data Base Systems

  1984cited by this paper
• R-trees: a dynamic index structure for spatial searching

  1984cited by this paper
• An algorithm for planning collision-free paths among polyhedral obstacles

  1979cited by this paper
• A note on two problems in connexion with graphs

  1959cited by this paper

• Modeling and Monitoring of Indoor Populations Using Sparse Positioning Data

  2024cites this paper
• Continuous Social Distance Monitoring in Indoor Space

  2022cites this paper
• Visibility Detection of 3D Objects and Visual K-Nearest Neighbor Query Based on Convex Hull Model

  2022cites this paper
• Skyline-Like Query in Three-Dimensional Obstacle Space

  2022cites this paper
• Processing Continuous k Nearest Neighbor Queries in Obstructed Space with Voronoi Diagrams

  2020cites this paper
• Multi-location Visibility Query and It’s Processing

  2020cites this paper
• Uncertain Data Clustering Based on Probability Distribution in Obstacle Space

  2020cites this paper
• Multi-location visibility query processing using portion-based transactional modeling and pattern mining

  2019cites this paper
• Reachable region query and its applications

  2019cites this paper
• Top-k trajectories with the best view

  2019cites this paper
• Direction-based Spatial Skyline for Retrieving Arbitrary-Shaped Surrounding Objects

  2019cites this paper
• Efficient Path Routing Over Road Networks in the Presence of Ad-Hoc Obstacles (Technical Report)

  2019cites this paper
• On VR Spatial Query for Dual Entangled Worlds

  2019cites this paper
• Continuous Obstructed Detour Queries

  2018cites this paper
• Range-Based Nearest Neighbor Queries with Complex-Shaped Obstacles

  2018cites this paper
• Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

  2018influential citation
• Adaptation of k-Nearest Neighbor Queries for Inter-building Environment

  2018cites this paper
• Variations of Nearest Neighbor Queries in Euclidean Space

  2017cites this paper
• A proposition of querying scheme with network Voronoi diagram in bichromatic reverse k-nearest neighbor

  2017cites this paper
• Authentication of k nearest neighbor queries in the presence of obstacles

  2017cites this paper
• Optimal Obstructed Sequenced Route Queries in Spatial Databases

  2017cites this paper
• Efficient processing of optimal obstructed sequenced route queries

  2017cites this paper
• Continuous Visible Query for Three-Dimensional Objects in Spatial Databases

  2016cites this paper
• Range-based Obstructed Nearest Neighbor Queries

  2016cites this paper
• Reverse k-nearest neighbor search in the presence of obstacles

  2016influential citation
• A Searching Method for Bichromatic Reverse k-Nearest Neighbor with Network Voronoi Diagram

  2016cites this paper
• Querying visible points in large obstructed space

  2015cites this paper
• Operators for Similarity Search

  2015influential citation
• Distance-Aware Join for Indoor Moving Objects

  2015cites this paper
• Advanced Operators for Similarity Search

  2015cites this paper
• A safe region based approach to moving KNN queries in obstructed space

  2014cites this paper
• An Efficient Method for k Nearest Neighbor Searching in Obstructed Spatial Databases

  2014cites this paper
• A Simple Routing Method for Reverse k-Nearest Neighbor Queries in Spatial Networks

  2014cites this paper
• A Journey from IFC Files to Indoor Navigation

  2014cites this paper
• Scalable Visibility Color Map Construction in Spatial Databases

  2013cites this paper
• Maximum visibility queries in spatial databases

  2013cites this paper
• A taxonomy for nearest neighbour queries in spatial databases

  2013cites this paper
• Efficient distance-aware query evaluation on indoor moving objects

  2013cites this paper
• Nearest surrounder searching in mobile computing environments

  2013cites this paper
• A Foundation for Efficient Indoor Distance-Aware Query Processing

  2012cites this paper
• All-Visible-k-Nearest-Neighbor Queries

  2012cites this paper
• A generic data model for moving objects

  2012cites this paper
• Electronic RFID-Based Indoor Moving Objects: Modeling and Applications

  2012cites this paper
• Semantics and Modeling of Indoor Moving Objects

  2012cites this paper
• INFORMATIK BERICHTE 360 – 08 / 2011 A Generic Data Model for Moving Objects

  2011cites this paper
• wNeighbors: A Method for Finding k Nearest Neighbors in Weighted Regions

  2011cites this paper
• Continuous nearest-neighbor search in the presence of obstacles

  2011cites this paper
• Continuous visible nearest neighbor query processing in spatial databases

  2011cites this paper
• On efficient obstructed reverse nearest neighbor query processing

  2011influential citation
• Continuous obstructed range queries in spatio-temporal databases

  2011cites this paper
• User-Centric Similarity and Proximity Measures for Spatial Personalization

  2010cites this paper
• Group Visible Nearest Neighbor Queries in Spatial Databases

  2010cites this paper
• Ranked Continuous Visible Nearest Neighbor Search

  2010cites this paper
• Incremental Evaluation of Visible Nearest Neighbor Queries

  2010cites this paper
• Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor space

  2010cites this paper
• Continuous visible nearest neighbor queries

  2009cites this paper
• Continuous obstructed nearest neighbor queries in spatial databases

  2009influential citation
• Visible Reverse k-Nearest Neighbor Query Processing in Spatial Databases

  2009cites this paper
• Visible Reverse k-Nearest Neighbor Queries

  2009cites this paper
• Research Statement My Research Focuses on Spatiotemporal Databases and Location Based Services, and Their Bridging with Mobile Computing and Data Stream Processing. Below, I Briefly Describe the Most Representative Aspects of My Work. Continuous Nearest Neighbor Monitoring

  2007cites this paper
• A Fast Filter for Obstructed Nearest Neighbor Queries

  2004cites this paper
• TR A 1 / 0 6 Efficient Constrained Delaunay Triangulation for Large Spatial Databases

  2004cites this paper