Reasoning about visibility
DOI10.1016/J.JAL.2012.02.001zbMATH Open1237.68209OpenAlexW2076905458MaRDI QIDQ420853FDOQ420853
Authors: Roger Villemaire, S. Hallé 
Publication date: 23 May 2012
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2012.02.001
Recommendations
- scientific article; zbMATH DE number 1182918
- Visibility queries in a polygonal region
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- Visibility between two edges of a simple polygon
- A modal logic for subject-oriented spatial reasoning
Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in artificial intelligence (68T27)
Cites Work
- Maintaining knowledge about temporal intervals
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Many-dimensional modal logics: theory and applications
- Computational geometry. Algorithms and applications.
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- The Complexity of the Partial Order Dimension Problem
- A special planar satisfiability problem and a consequence of its NP- completeness
- Decomposable searching problems
- Handbook of Spatial Logics
- Optimal Point Location in a Monotone Subdivision
- Multidimensional binary search trees used for associative searching
- Qualitative spatial representation and reasoning: An overview
- Lower bounds for orthogonal range searching: I. The reporting case
- Complexity and algorithms for reasoning about time
- Individuals and points
- Box sort, a multidimensional binary sorting method for rectangular boxes, used for quick range searching
- A calculus of individuals based on 'connection'
- Title not available (Why is that?)
- Computing and Verifying Depth Orders
- Title not available (Why is that?)
- Data and Applications Security XIX
- Structured firewall design
Cited In (3)
Uses Software
This page was built for publication: Reasoning about visibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420853)
