On the public citation graph
Visibility of disjoint polygons
0 signed · 223 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230140304openalex-snapshot
Euclidean shortest paths in the presence of rectilinear barriers
inferredcites →https://doi.org/10.1016/0020-0190(78)90062-5openalex-snapshot
Triangulating a simple polygon
inferredcites →https://doi.org/10.1016/0020-0190(85)90044-4openalex-snapshot
Constructing the visibility graph for n-line segments in O(n2) time
inferredcites →https://doi.org/10.1016/0022-0000(85)90014-5openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1016/0196-6774(81)90019-5openalex-snapshot
A linear algorithm for computing the visibility polygon from a point
inferredcites →https://doi.org/10.1016/0734-189x(83)90065-8openalex-snapshot
Visibility of a simple polygon
inferredcites →https://doi.org/10.1109/sfcs.1980.6openalex-snapshot
A linear time algorithm for the lowest common ancestors problem
inferredcites →https://doi.org/10.1109/sfcs.1983.11openalex-snapshot
Constructing arrangements of lines and hyperplanes with applications
inferredcites →https://doi.org/10.1109/sfcs.1983.17openalex-snapshot
Filtering search: A new approach to query-answering
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1145/800057.808676openalex-snapshot
On shortest paths in polyhedral spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rob.4620070107openalex-snapshot
An efficient algorithm for finding a collision‐free path among polyhedral obstacles
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1051openalex-snapshot
Optimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane
inferred← citeshttps://doi.org/10.1007/3-540-17218-1_63openalex-snapshot
Centipede graphs and visibility on a cylinder
inferred← citeshttps://doi.org/10.1007/3-540-44438-6_30openalex-snapshot
A New Visibility Partition for Affine Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-50335-8_36openalex-snapshot
Using gale transforms in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_105openalex-snapshot
Upper envelope onion peeling
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_81openalex-snapshot
The visibility diagram: A data structure for visibility problems and motion planning
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_56openalex-snapshot
An on-line algorithm for navigating in unknown terrain
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_20openalex-snapshot
Selected topics from computational geometry, data structures and motion planning
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_53openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_75openalex-snapshot
Characterizing and recognizing visibility graphs of Funnel-shaped polygons
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_509openalex-snapshot
Geometric Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_4openalex-snapshot
Maintaining the Visibility Graph of a Dynamic Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-030-58150-3_11openalex-snapshot
Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-92681-6_1openalex-snapshot
Routing Among Convex Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-032-04731-1_18openalex-snapshot
The Maximum Cover for Passive Localisation
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_4openalex-snapshot
Steiner Trees with Other Cost Functions and Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-22786-3_12openalex-snapshot
A Deviation Flow Refueling Location Model for Continuous Space: A Commercial Drone Delivery System for Urban Areas
inferred← citeshttps://doi.org/10.1007/978-3-319-46922-5_7openalex-snapshot
Continuous Maximum Visibility Query for a Moving Target
inferred← citeshttps://doi.org/10.1007/978-3-319-53007-9_19openalex-snapshot
Incremental Algorithms to Update Visibility Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-24741-8_22openalex-snapshot
Spatial Queries in the Presence of Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_7openalex-snapshot
Shortest Paths for Disc Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-540-74472-6_6openalex-snapshot
Weak Visibility of Two Objects in Planar Polygonal Scenes
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_14openalex-snapshot
Space–Query-Time Tradeoff for Computing the Visibility Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-11440-3_3openalex-snapshot
Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_2openalex-snapshot
An Optimal Hidden-Surface Algorithm and Its Parallelization
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_509-1openalex-snapshot
Geometric Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_19openalex-snapshot
Computing the Visibility Polygon of an Island in a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_6openalex-snapshot
Lower Bounds for Sorted Geometric Queries in the I/O Model
inferred← citeshttps://doi.org/10.1007/978-3-642-74575-1_13openalex-snapshot
Global Path Planning Approaches for Material Movements in a Worksite
inferred← citeshttps://doi.org/10.1007/978-3-7091-2830-5_7openalex-snapshot
A Survey of Constrained Delaunay Triangulation Algorithms for Surface Representation
inferred← citeshttps://doi.org/10.1007/bf01300372openalex-snapshot
Characterizing and recognizing the visibility graph of a funnel-shaped polygon
inferred← citeshttps://doi.org/10.1007/bf01530888openalex-snapshot
A new algorithm for shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
inferred← citeshttps://doi.org/10.1007/bf01582886openalex-snapshot
Using Gale transforms in computational geometry
inferred← citeshttps://doi.org/10.1007/bf01758836openalex-snapshot
L 1 shortest paths among polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/bf01758843openalex-snapshot
An efficient algorithm for one-step planar compliant motion planning with uncertainty
inferred← citeshttps://doi.org/10.1007/bf01840385openalex-snapshot
A fast algorithm for computing sparse visibility graphs
inferred← citeshttps://doi.org/10.1007/bf01840394openalex-snapshot
The complexity of planar compliant motion planning under uncertainty
inferred← citeshttps://doi.org/10.1007/bf01905560openalex-snapshot
Visibility problems for orthogonal objects in two-or three-dimensions
inferred← citeshttps://doi.org/10.1007/bf01908631openalex-snapshot
Planning a time-minimal motion among moving obstacles
inferred← citeshttps://doi.org/10.1007/bf01928918openalex-snapshot
Visibility graphs and obstacle-avoiding shortest paths
inferred← citeshttps://doi.org/10.1007/bf02067242openalex-snapshot
On graphs preserving rectilinear shortest paths in the presence of obstacles
inferred← citeshttps://doi.org/10.1007/bf02187695openalex-snapshot
Generalized delaunay triangulation for planar graphs
inferred← citeshttps://doi.org/10.1007/bf02187714openalex-snapshot
Rectilinear shortest paths in the presence of rectangular barriers
inferred← citeshttps://doi.org/10.1007/bf02712876openalex-snapshot
Topologically sweeping visibility complexes via pseudotriangulations
inferred← citeshttps://doi.org/10.1007/bfb0028272openalex-snapshot
On bends and lengths of rectilinear paths: A graph-theoretic approach
inferred← citeshttps://doi.org/10.1007/bfb0028282openalex-snapshot
An optimal algorithm for computing visibility in the plane
inferred← citeshttps://doi.org/10.1007/pl00009323openalex-snapshot
An Efficient Algorithm for Euclidean Shortest Paths Among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s00373-022-02559-yopenalex-snapshot
On Rainbow Quadrilaterals in Colored Point Sets
inferred← citeshttps://doi.org/10.1007/s00453-015-0058-yopenalex-snapshot
Computing the Visibility Polygon of an Island in a Polygonal Domain
inferred← citeshttps://doi.org/10.1007/s00453-020-00673-yopenalex-snapshot
Shortest Paths in the Plane with Obstacle Violations
inferred← citeshttps://doi.org/10.1007/s004539910018openalex-snapshot
Visibility-Based Planning of Sensor Control Strategies
inferred← citeshttps://doi.org/10.1007/s10618-019-00641-3openalex-snapshot
Multi-location visibility query processing using portion-based transactional modeling and pattern mining
inferred← citeshttps://doi.org/10.1007/s10707-019-00343-4openalex-snapshot
Top-k trajectories with the best view
inferred← citeshttps://doi.org/10.1007/s10846-016-0409-1openalex-snapshot
Approximate 3D Euclidean Shortest Paths for Unmanned Aircraft in Urban Environments
inferred← citeshttps://doi.org/10.1007/s10851-025-01250-0openalex-snapshot
The Maximum Cover with Rotating Field of View
inferred← citeshttps://doi.org/10.1007/s10878-020-00604-1openalex-snapshot
Shortest paths among transient obstacles
inferred← citeshttps://doi.org/10.1007/s10878-022-00846-1openalex-snapshot
Visibility polygons and visibility graphs among dynamic polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.1007/s10878-026-01443-2openalex-snapshot
Routing among Convex Polygonal Obstacles in the Plane using a Simplified Domain
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90054-9openalex-snapshot
An algorithmic approach to some problems in terrain navigation
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90038-xopenalex-snapshot
A tight lower bound on the size of visibility graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90150-5openalex-snapshot
Shortest path between two simple polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90022-1openalex-snapshot
Time and space efficient algorithms for shortest paths between convex polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90136-1openalex-snapshot
Finding the upper envelope of n line segments in O(n log n) time
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90033-ropenalex-snapshot
Computing the full visibility graph of a set of line segments
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90020-lopenalex-snapshot
On maximum flows in polyhedral domains
inferred← citeshttps://doi.org/10.1016/0166-218x(96)80467-7openalex-snapshot
Rectilinear paths among rectilinear obstacles
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90024-sopenalex-snapshot
Computing the visibility polygon from a convex set and related problems
inferred← citeshttps://doi.org/10.1016/0734-189x(88)90145-4openalex-snapshot
Some location problems for robot navigation using a single camera
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90007-fopenalex-snapshot
Hidden surface removal for c-oriented polyhedra
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90027-popenalex-snapshot
Upper envelope onion peeling
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00016-xopenalex-snapshot
Minimal tangent visibility graphs
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00045-3openalex-snapshot
Perfect binary space partitions
inferred← citeshttps://doi.org/10.1016/1049-9652(92)90076-aopenalex-snapshot
An on-line algorithm for constrained Delaunay triangulation
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50009-5openalex-snapshot
Voronoi Diagram for Points in a Simple Polygon
inferred← citeshttps://doi.org/10.1016/b978-0-444-87137-4.50014-xopenalex-snapshot
Computing Visibility Properties of Polygons
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot
Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.cageo.2022.105228openalex-snapshot
Computational morphology of debris and alluvial fans on irregular terrain using the visibility polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.05.001openalex-snapshot
A linear time algorithm to remove winding of a simple polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.10.004openalex-snapshot
Space/query-time tradeoff for computing the visibility polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.003openalex-snapshot
Visibility and ray shooting queries in polygonal domains
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.101593openalex-snapshot
Routing in polygonal domains
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102258openalex-snapshot
Constrained two-line center problems
inferred← citeshttps://doi.org/10.1016/j.dam.2009.12.004openalex-snapshot
Approximation algorithms for art gallery problems in polygons
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.04.005openalex-snapshot
GPU Parallel Visibility Algorithm for a Set of Segments Using Merge Path
inferred← citeshttps://doi.org/10.1016/j.is.2013.12.002openalex-snapshot
Scalable visibility color map construction in spatial databases
inferred← citeshttps://doi.org/10.1016/j.is.2016.04.003openalex-snapshot
Group meetup in the presence of obstacles
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2021.07.013openalex-snapshot
Optimal scan planning with enforced network connectivity for the acquisition of three-dimensional indoor models
inferred← citeshttps://doi.org/10.1016/j.robot.2004.02.005openalex-snapshot
Mobile-robot navigation with complete coverage of unstructured environments
inferred← citeshttps://doi.org/10.1016/j.robot.2006.04.001openalex-snapshot
Fuzzy potential energy for a map approach to robot navigation
inferred← citeshttps://doi.org/10.1016/j.robot.2013.07.010openalex-snapshot
Path planning with obstacle avoidance based on visibility binary tree algorithm
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.06.017openalex-snapshot
A time–space trade-off for computing the k-visibility region of a point in a polygon
inferred← citeshttps://doi.org/10.1016/j.trc.2018.02.017openalex-snapshot
A range-restricted recharging station coverage model for drone delivery service planning
inferred← citeshttps://doi.org/10.1016/j.trc.2018.10.010openalex-snapshot
Validation of an agent-based building evacuation model with a school drill
inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot
Picture Processing: 1986
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00070-0openalex-snapshot
Efficient visibility queries in simple polygons
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1016/s1045-926x(05)80027-8openalex-snapshot
Visual reply to map-related queries
inferred← citeshttps://doi.org/10.1017/s0263574700016556openalex-snapshot
Avoidance of obstacles with unknown trajectories: locally optimal paths and path complexity, Part I
inferred← citeshttps://doi.org/10.1017/s0263574700016957openalex-snapshot
Avoidance of obstacles with unknown trajectories: locally optimal paths and path complexity, Part II
inferred← citeshttps://doi.org/10.1080/02693799408901986openalex-snapshot
Nearest neighbourhood operations with generalized Voronoi diagrams: a review
inferred← citeshttps://doi.org/10.1080/13658810500286935openalex-snapshot
Query processing in spatial databases containing obstacles
inferred← citeshttps://doi.org/10.1080/13658816.2013.788182openalex-snapshot
Efficient measurement of continuous space shortest distance around barriers
inferred← citeshttps://doi.org/10.1109/12.286304openalex-snapshot
On bends and distances of paths among obstacles in two-layer interconnection model
inferred← citeshttps://doi.org/10.1109/3468.833100openalex-snapshot
Mobile robot navigation in 2-D dynamic environments using an electrostatic potential field
inferred← citeshttps://doi.org/10.1109/70.338536openalex-snapshot
Computation of the tangent graph of polygonal obstacles by moving-line processing
inferred← citeshttps://doi.org/10.1109/70.466615openalex-snapshot
Finding the shortest path of a disc among polygonal obstacles using a radius-independent graph
inferred← citeshttps://doi.org/10.1109/70.56665openalex-snapshot
Path planning in the presence of vertical obstacles
inferred← citeshttps://doi.org/10.1109/70.954761openalex-snapshot
Autonomous vehicle navigation utilizing electrostatic potential fields and fuzzy logic
inferred← citeshttps://doi.org/10.1109/71.980023openalex-snapshot
On computing the upper envelope of segments in parallel
inferred← citeshttps://doi.org/10.1109/cdc.2008.4739394openalex-snapshot
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
inferred← citeshttps://doi.org/10.1109/compsac54236.2022.00021openalex-snapshot
Reliable Visibility Algorithms for Emergency Stop Systems in Smart Industries
inferred← citeshttps://doi.org/10.1109/fuzzy.2006.1681754openalex-snapshot
Fuzzy Potential Energy for a Map Approach to Robot navigation
inferred← citeshttps://doi.org/10.1109/icara64554.2025.10977725openalex-snapshot
On an Almost Closed-Form Fast Generation of Euclidean Shortest Path Trajectories in Cluttered Environments
inferred← citeshttps://doi.org/10.1109/icarcv63323.2024.10821670openalex-snapshot
Overview of Motion Planning Techniques and Their Suitability for an Off-Road Navigation Use-Case
inferred← citeshttps://doi.org/10.1109/icci.1993.315402openalex-snapshot
Far field path planning for rotorcraft NOE missions in a mountainous region
inferred← citeshttps://doi.org/10.1109/icde.2013.6544862openalex-snapshot
Maximum visibility queries in spatial databases
inferred← citeshttps://doi.org/10.1109/icpp.1998.708493openalex-snapshot
On computing the upper envelope of segments in parallel
inferred← citeshttps://doi.org/10.1109/icra.2011.5980268openalex-snapshot
Reachability-based synthesis of feedback policies for motion planning under bounded disturbances
inferred← citeshttps://doi.org/10.1109/icra57147.2024.10611529openalex-snapshot
An Efficient Solution to the 2D Visibility Problem in Cartesian Grid Maps and its Application in Heuristic Path Planning
inferred← citeshttps://doi.org/10.1109/iros.1999.811745openalex-snapshot
Three or more dimensional digital tangential graph and its motion-planning
inferred← citeshttps://doi.org/10.1109/iros.2004.1389835openalex-snapshot
Dynamic visibility graph for path planning
inferred← citeshttps://doi.org/10.1109/iros.2005.1545545openalex-snapshot
A comparative study between visibility-based roadmap path planning algorithms
inferred← citeshttps://doi.org/10.1109/iros.2018.8594124openalex-snapshot
Minimal Construct: Efficient Shortest Path Finding for Mobile Robots in Polygonal Maps
inferred← citeshttps://doi.org/10.1109/isatp.2001.929001openalex-snapshot
A convergence proof of a fusion algorithm of global and local path-planning for multiple mobile robots
inferred← citeshttps://doi.org/10.1109/jra.1987.1087093openalex-snapshot
How to move a chair through a door
inferred← citeshttps://doi.org/10.1109/robot.1986.1087425openalex-snapshot
On translating ellipses amidst elliptic obstacles
inferred← citeshttps://doi.org/10.1109/robot.1987.1087801openalex-snapshot
Navigation algorithm for a nested hierarchical system of robot path planning among polyhedral obstacles
inferred← citeshttps://doi.org/10.1109/robot.1989.100129openalex-snapshot
Time-minimal paths among moving obstacles
inferred← citeshttps://doi.org/10.1109/robot.1990.125996openalex-snapshot
Motion planning in a dynamic domain
inferred← citeshttps://doi.org/10.1109/robot.1992.219916openalex-snapshot
The window corner algorithm for robot path planning with translations
inferred← citeshttps://doi.org/10.1109/roman.2000.892476openalex-snapshot
A comparative study between on-line and off-line navigations on intelligent transportation system
inferred← citeshttps://doi.org/10.1109/sfcs.1987.6openalex-snapshot
An output sensitive algorithm for computing visibility graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267794openalex-snapshot
Computing a shortest k-link path in a polygon
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366836openalex-snapshot
Efficient computation of Euclidean shortest paths in the plane
inferred← citeshttps://doi.org/10.1109/sice.2006.315424openalex-snapshot
A Practical Roadmap for the Path Planning of Mobile Robots in Rectilinear Environments
inferred← citeshttps://doi.org/10.1109/tce.2007.381724openalex-snapshot
A Practical Path Planner for the Robotic Vacuum Cleaner in Rectilinear Environments
inferred← citeshttps://doi.org/10.1109/tkde.2009.158openalex-snapshot
Incremental Evaluation of Visible Nearest Neighbor Queries
inferred← citeshttps://doi.org/10.1111/gean.12086openalex-snapshot
Spatial Filtering for Identifying a Shortest Path Around Obstacles
inferred← citeshttps://doi.org/10.1115/1.4043566openalex-snapshot
Planning the Shortest Path in Cluttered Environments: A Review and a Planar Convex Hull-Based Approach
inferred← citeshttps://doi.org/10.1117/12.25506openalex-snapshot
Algorithmic approaches to optimal route planning
inferred← citeshttps://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferred← citeshttps://doi.org/10.1137/110840030openalex-snapshot
Computing Shortest Paths amid Convex Pseudodisks
inferred← citeshttps://doi.org/10.1137/s0097539791221505openalex-snapshot
An Optimal Algorithm for Computing Visibility in the Plane
inferred← citeshttps://doi.org/10.1137/s0097539795253591openalex-snapshot
Efficiently Constructing the Visibility Graph of a Simple Polygon with Obstacles
inferred← citeshttps://doi.org/10.1137/s0097539795289604openalex-snapshot
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
inferred← citeshttps://doi.org/10.1142/s0218195900000309openalex-snapshot
VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME
inferred← citeshttps://doi.org/10.1142/s021819592050003xopenalex-snapshot
Dynamic Algorithms for Visibility Polygons in Simple Polygons
inferred← citeshttps://doi.org/10.1142/s0218195998000229openalex-snapshot
A Computational Geometric Approach to Visual Hulls
inferred← citeshttps://doi.org/10.1145/100348.100359openalex-snapshot
Using focusing search algorithms and a strong heuristic to solve the findpath problem in robotics
inferred← citeshttps://doi.org/10.1145/10515.10517openalex-snapshot
Worst-case optimal algorithms for constructing visibility polygons with holes
inferred← citeshttps://doi.org/10.1145/1556154.1556163openalex-snapshot
Review of visibility algorithms in the plane by Subir Kumar Ghosh (Cambridge University Press, 2007)
inferred← citeshttps://doi.org/10.1145/160985.161156openalex-snapshot
Shortest paths among obstacles in the plane
inferred← citeshttps://doi.org/10.1145/185675.185795openalex-snapshot
Shortest paths in the plane with polygonal obstacles
inferred← citeshttps://doi.org/10.1145/220279.220320openalex-snapshot
Rectilinear geodesics in 3-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/237218.237403openalex-snapshot
Monotonicity of rectilinear geodesics in d-space (extended abstract)
inferred← citeshttps://doi.org/10.1145/2462356.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2493132.2462377openalex-snapshot
Computing shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2533828.2533834openalex-snapshot
Efficient wayfinding in complex environments
inferred← citeshttps://doi.org/10.1145/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.1145/2660771openalex-snapshot
Computing Shortest Paths among Curved Obstacles in the Plane
inferred← citeshttps://doi.org/10.1145/41958.41960openalex-snapshot
Finding the visibility graph of a simple polygon in time proportional to its size
inferred← citeshttps://doi.org/10.1145/41958.41964openalex-snapshot
Optimal shortest path queries in a simple polygon
inferred← citeshttps://doi.org/10.1145/73393.73410openalex-snapshot
New methods for computing visibility graphs
inferred← citeshttps://doi.org/10.1145/73393.73425openalex-snapshot
The complexity of planar compliant motion planning under uncertainty
inferred← citeshttps://doi.org/10.1145/73833.73855openalex-snapshot
An efficient algorithm for one-step planar complaint motion planning with uncertainty
inferred← citeshttps://doi.org/10.1145/98524.98595openalex-snapshot
Shortest rectilinear paths among weighted obstacles
inferred← citeshttps://doi.org/10.1145/997817.997825openalex-snapshot
Computing the visibility graph of points within a polygon
inferred← citeshttps://doi.org/10.1155/2017/2849745openalex-snapshot
Efficient Energy Flight Path Planning Algorithm Using 3-D Visibility Roadmap for Small Unmanned Aerial Vehicle
inferred← citeshttps://doi.org/10.1201/9781439864524-26openalex-snapshot
Robust Geometric Algorithms for Sensor Planning
inferred← citeshttps://doi.org/10.1364/ao.416563openalex-snapshot
Simulations of vehicular optical wireless communication systems and comparisons with DSRC systems
inferred← citeshttps://doi.org/10.1364/fio.2018.jtu3a.77openalex-snapshot
Vehicular FSO Communication Systems Applying Real-time Recognition and Tracking
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a14openalex-snapshot
A new algorithm for computing visibility graphs of polygonal obstacles in the plane
inferred← citeshttps://doi.org/10.20868/upm.thesis.40622openalex-snapshot
Applications of Formal Languages to Management of Manned and Unmanned Aircraft
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3481646/v1openalex-snapshot
The Maximum Cover with Rotating Field of View
inferred← citeshttps://doi.org/10.2139/ssrn.5399790openalex-snapshot
Constrained Two-Line Center Problems
inferred← citeshttps://doi.org/10.22215/etd/2019-13533openalex-snapshot
Shortest Paths Among Dynamic Obstacles
inferred← citeshttps://doi.org/10.24200/sci.2024.63200.8282openalex-snapshot
Pseudo-Triangle Visibility Graph: Characterization and Reconstruction
inferred← citeshttps://doi.org/10.2478/amcs-2018-0038openalex-snapshot
An Exact Geometry–Based Algorithm for Path Planning
inferred← citeshttps://doi.org/10.2514/1.c035473openalex-snapshot
A Multi-Trip Vehicle Routing Problem for Small Unmanned Aircraft Systems-Based Urban Delivery
inferred← citeshttps://doi.org/10.2514/6.2008-7132openalex-snapshot
Tunnel-MILP: Path Planning with Sequential Convex Polytopes
inferred← citeshttps://doi.org/10.2514/6.2008-7410openalex-snapshot
Quadrotor Helicopter Trajectory Tracking Control
inferred← citeshttps://doi.org/10.32657/10356/39353openalex-snapshot
Path finding and flow control for virtual reality augmented evacuation system for large indoor areas
inferred← citeshttps://doi.org/10.32657/10356/41757openalex-snapshot
Nodal-based discontinuous deformation analysis
showing the first 200 of 211 · page through all 211
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.