On the public citation graph
Visibility and intersection problems in plane geometry
0 signed · 212 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.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bf01840360openalex-snapshot
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf01840366openalex-snapshot
Computing on a free tree via complexity-preserving mappings
inferredcites →https://doi.org/10.1007/bf01840440openalex-snapshot
Fractional cascading: I. A data structuring technique
inferredcites →https://doi.org/10.1007/bf01840441openalex-snapshot
Fractional cascading: II. Applications
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1109/sfcs.1983.1openalex-snapshot
A kinetic framework for computational geometry
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferredcites →https://doi.org/10.1137/0217010openalex-snapshot
An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
inferredcites →https://doi.org/10.1145/41958.41964openalex-snapshot
Optimal shortest path queries in a simple polygon
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jagm.1994.1038openalex-snapshot
Applications of Parametric Searching in Geometric Optimization
inferred← citeshttps://doi.org/10.1006/jagm.1995.0797openalex-snapshot
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
inferred← citeshttps://doi.org/10.1006/jagm.1995.1017openalex-snapshot
A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
inferred← citeshttps://doi.org/10.1006/jagm.1996.0023openalex-snapshot
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
inferred← citeshttps://doi.org/10.1006/jagm.1996.0056openalex-snapshot
Ray Shooting Amidst Convex Polygons in 2D
inferred← citeshttps://doi.org/10.1007/11750321_17openalex-snapshot
Linear-Time 2-Approximation Algorithm for the Watchman Route Problem
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_11openalex-snapshot
Computing the minimum visible vertex distance between two polygons
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_12openalex-snapshot
Computing the kernel of a point set in a polygon
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_80openalex-snapshot
Graphics in flatland revisited
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_172openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/3-540-55488-2_30openalex-snapshot
On spanning trees with low crossing numbers
inferred← citeshttps://doi.org/10.1007/3-540-55706-7_33openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
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/3-540-57568-5_263openalex-snapshot
Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_1openalex-snapshot
Computing depth orders and related problems
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_61openalex-snapshot
Computing common tangents without a separating line
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_24openalex-snapshot
Hardness of Segment Cover, Contiguous SAT and Visibility with Uncertain Obstacles
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_13openalex-snapshot
Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-319-08016-1_21openalex-snapshot
Finding Simple Paths on Given Points in a Polygonal Region
inferred← citeshttps://doi.org/10.1007/978-3-319-13287-7_14openalex-snapshot
A Characterization of Link-2 LR-visibility Polygons with Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-13287-7_3openalex-snapshot
Decomposing Octilinear Polygons into Triangles and Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_1openalex-snapshot
Simplex Range Searching and Its Variants: A Review
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-319-55911-7_44openalex-snapshot
Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-30540-8_22openalex-snapshot
A Characterization of Polygonal Regions Searchable from the Boundary
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_43openalex-snapshot
Ray Shooting and Stone Throwing
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_28openalex-snapshot
An Efficient Solution to the Corridor Search Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_24openalex-snapshot
Searching a Polygonal Region by Two Guards
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-02017-9_37openalex-snapshot
Searching a Circular Corridor with Two Flashlights
inferred← citeshttps://doi.org/10.1007/978-3-642-02270-8_16openalex-snapshot
Processing an Offline Insertion-Query Sequence with Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-14553-7_29openalex-snapshot
Optimum Sweeps of Simple Polygons with Two Guards
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_30openalex-snapshot
Approximating Minimum Bending Energy Path in a Simple Corridor
inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_5openalex-snapshot
Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region
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-40104-6_22openalex-snapshot
Visibility and Ray Shooting Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-83069-3_24openalex-snapshot
Computational Geometry: Recent Results Relevant to Pattern Recognition
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_4openalex-snapshot
Ruler, Compass and Computer
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/978-94-009-3757-4_47openalex-snapshot
Computational Geometry and Morphology
inferred← citeshttps://doi.org/10.1007/bf00054919openalex-snapshot
Visibility, occlusion, and the aspect graph
inferred← citeshttps://doi.org/10.1007/bf01206329openalex-snapshot
A linear-time algorithm for constructing a circular visibility diagram
inferred← citeshttps://doi.org/10.1007/bf01293267openalex-snapshot
An improved technique for output-sensitive hidden surface removal
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/bf01377182openalex-snapshot
Efficient ray shooting and hidden surface removal
inferred← citeshttps://doi.org/10.1007/bf01377183openalex-snapshot
Ray shooting in polygons using geodesic triangulations
inferred← citeshttps://doi.org/10.1007/bf01758856openalex-snapshot
Parallel methods for visibility and shortest-path problems in simple polygons
inferred← citeshttps://doi.org/10.1007/bf01840400openalex-snapshot
Some chain visibility problems in a simple polygon
inferred← citeshttps://doi.org/10.1007/bf01933206openalex-snapshot
On the minimality of polygon triangulation
inferred← citeshttps://doi.org/10.1007/bf02187743openalex-snapshot
Quasi-optimal range searching in spaces of finite VC-dimension
inferred← citeshttps://doi.org/10.1007/bf02189304openalex-snapshot
Applications of a new space-partitioning technique
inferred← citeshttps://doi.org/10.1007/bf02189321openalex-snapshot
The furthest-site geodesic voronoi diagram
inferred← citeshttps://doi.org/10.1007/bf02523191openalex-snapshot
Decomposing the boundary of a nonconvex polyhedron
inferred← citeshttps://doi.org/10.1007/bf02574015openalex-snapshot
On range searching with semialgebraic sets
inferred← citeshttps://doi.org/10.1007/bf02574385openalex-snapshot
Can visibility graphs Be represented compactly?
inferred← citeshttps://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferred← citeshttps://doi.org/10.1007/bfb0035855openalex-snapshot
An optimal algorithm for detecting weak visibility of a polygon
inferred← citeshttps://doi.org/10.1007/pl00008263openalex-snapshot
A Randomized Algorithm for the Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
inferred← citeshttps://doi.org/10.1007/pl00009271openalex-snapshot
Computing Vision Points in Polygons
inferred← citeshttps://doi.org/10.1007/s00453-006-1229-7openalex-snapshot
Motorcycle Graphs and Straight Skeletons
inferred← citeshttps://doi.org/10.1007/s00453-008-9270-3openalex-snapshot
Guarding a Terrain by Two Watchtowers
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-018-00540-xopenalex-snapshot
Computing $$L_1$$ Shortest Paths Among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/s004530010042openalex-snapshot
A Unified Approach to Conic Visibility
inferred← citeshttps://doi.org/10.1007/s00454-001-0089-9openalex-snapshot
Visibility Queries and Maintenance in Simple Polygons
inferred← citeshttps://doi.org/10.1007/s00454-004-1098-2openalex-snapshot
Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons
inferred← citeshttps://doi.org/10.1007/s00454-013-9515-zopenalex-snapshot
Tracing Compressed Curves in Triangulated Surfaces
inferred← citeshttps://doi.org/10.1007/s00454-024-00637-xopenalex-snapshot
Computing Instance-Optimal Kernels in Two Dimensions
inferred← citeshttps://doi.org/10.1007/s00454-024-00709-yopenalex-snapshot
Algorithms for Halfplane Coverage and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-025-00768-9openalex-snapshot
The Geodesic Edge Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s11390-008-9179-yopenalex-snapshot
Searching a Polygonal Region by Two Guards
inferred← citeshttps://doi.org/10.1007/s11390-009-9241-4openalex-snapshot
Searching a Polygonal Region by a Boundary Searcher
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90167-vopenalex-snapshot
Computing the longest diagonal of a simple polygon
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90014-mopenalex-snapshot
Special subgraphs of weighted visibility graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00092-1openalex-snapshot
Distance measures on intersecting objects and their applications
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/0304-3975(95)95693-eopenalex-snapshot
A note on the combinatorial structure of the visibility graph in simple polygons
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00005-8openalex-snapshot
Computing depth orders for fat objects and related problems
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00008-9openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00042-9openalex-snapshot
LR-visibility in polygons
inferred← citeshttps://doi.org/10.1016/1049-9652(91)90056-popenalex-snapshot
Fitting polygonal functions to a set of points in the plane
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-044482537-7/50020-6openalex-snapshot
Visibility in the Plane
inferred← citeshttps://doi.org/10.1016/j.amc.2018.04.010openalex-snapshot
Shortcut sets for the locus of plane Euclidean networks
inferred← citeshttps://doi.org/10.1016/j.cam.2012.11.001openalex-snapshot
Direct multiple shooting method for solving approximate shortest path problems
inferred← citeshttps://doi.org/10.1016/j.cam.2015.04.018openalex-snapshot
Weak visibility counting in simple polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.10.001openalex-snapshot
Ray shooting and stone throwing with near-linear storage
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.02.005openalex-snapshot
Query point visibility computation in polygons with holes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.04.001openalex-snapshot
A unified and efficient solution to the room search problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.09.001openalex-snapshot
Approximating minimum bending energy path in a simple corridor
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.2015.02.001openalex-snapshot
Weak visibility queries of line segments in simple polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2008.05.007openalex-snapshot
An efficient algorithm for the three-guard problem
inferred← citeshttps://doi.org/10.1016/j.dam.2010.10.007openalex-snapshot
Searching for mobile intruders in circular corridors by two 1-searchers
inferred← citeshttps://doi.org/10.1016/j.dam.2018.09.020openalex-snapshot
Computing simple paths from given points inside a polygon
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.034openalex-snapshot
Algorithmic enumeration of surrounding polygons
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.05.018openalex-snapshot
Computing optimal shortcuts for networks
inferred← citeshttps://doi.org/10.1016/j.endm.2016.09.029openalex-snapshot
Shortcut sets for plane Euclidean networks (Extended abstract)
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.11.002openalex-snapshot
Optimum sweeps of simple polygons with two guards
inferred← citeshttps://doi.org/10.1016/j.jda.2015.10.002openalex-snapshot
Near optimal line segment queries in simple polygons
inferred← citeshttps://doi.org/10.1016/j.orl.2005.02.004openalex-snapshot
Locating two obnoxious facilities using the weighted maximin criterion
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.021openalex-snapshot
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.03.019openalex-snapshot
Minimization of the maximum distance between the two guards patrolling a polygonal region
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.037openalex-snapshot
Approximation algorithms for decomposing octilinear polygons
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00211-1openalex-snapshot
Maintaining visibility of a polygon with a moving point of view
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00451-7openalex-snapshot
Approximation algorithms for the watchman route and zookeeper's problems
inferred← citeshttps://doi.org/10.1016/s0734-189x(89)80018-0openalex-snapshot
The visual potential: One convex polygon
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80063-6openalex-snapshot
Non-convex contour reconstruction
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80065-xopenalex-snapshot
An algorithm for generalized point location and its applications
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80003-3openalex-snapshot
Visibility problems for polyhedral terrains
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00036-0openalex-snapshot
Polygons cuttable by a circular saw
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00070-0openalex-snapshot
Efficient visibility queries in simple polygons
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00092-5openalex-snapshot
An O(nlogn) algorithm for the zoo-keeper's problem
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00027-2openalex-snapshot
3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
inferred← citeshttps://doi.org/10.1017/s0263574700009644openalex-snapshot
Separability of pairs of polygons through single translations
inferred← citeshttps://doi.org/10.1080/02693799408901986openalex-snapshot
Nearest neighbourhood operations with generalized Voronoi diagrams: a review
inferred← citeshttps://doi.org/10.1080/24694452.2020.1760779openalex-snapshot
Developing a Comprehensive and Coherent Shape Compactness Metric for Gerrymandering
inferred← citeshttps://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferred← citeshttps://doi.org/10.1109/bdcloud.2015.65openalex-snapshot
Searching a Circular Corridor with Three Flashlights
inferred← citeshttps://doi.org/10.1109/csicc.2009.5349323openalex-snapshot
Visibility of a moving segment observer
inferred← citeshttps://doi.org/10.1109/focs.2012.32openalex-snapshot
On Range Searching with Semialgebraic Sets II
inferred← citeshttps://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferred← citeshttps://doi.org/10.1109/ipps.1993.262818openalex-snapshot
Parallel analog algorithms for processing polygonal images on a systolic screen
inferred← citeshttps://doi.org/10.1109/ipps.1993.262878openalex-snapshot
Optimal mesh computer algorithms for simple polygons
inferred← citeshttps://doi.org/10.1109/ipps.1996.508057openalex-snapshot
A randomized algorithm for Voronoi diagram of line segments on coarse grained multiprocessors
inferred← citeshttps://doi.org/10.1109/iros.2018.8594048openalex-snapshot
Guaranteed Coverage with a Blind Unreliable Robot
inferred← citeshttps://doi.org/10.1109/jcsse49651.2020.9268436openalex-snapshot
Building two communication towers over a terrain
inferred← citeshttps://doi.org/10.1109/robot.1993.292037openalex-snapshot
On computing a distance measure for path planning
inferred← citeshttps://doi.org/10.1109/robot.2005.1570694openalex-snapshot
Almost-Sensorless Localization
inferred← citeshttps://doi.org/10.1109/robot.2006.1641158openalex-snapshot
Global localization using odometry
inferred← citeshttps://doi.org/10.1109/romoco.2005.201394openalex-snapshot
Information spaces for mobile robots
inferred← citeshttps://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1109/tro.2007.900636openalex-snapshot
Localization With Limited Sensing
inferred← citeshttps://doi.org/10.1111/j.1467-8659.1986.tb00297.xopenalex-snapshot
Image Generation by Space Sweep
inferred← citeshttps://doi.org/10.1137/0219020openalex-snapshot
Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot
Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
inferred← citeshttps://doi.org/10.1137/0221038openalex-snapshot
Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
inferred← citeshttps://doi.org/10.1137/21m145118xopenalex-snapshot
Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments
inferred← citeshttps://doi.org/10.1137/s0097539792224516openalex-snapshot
A Unified Approach to Dynamic Point Location, Ray shooting, and Shortest Paths in Planar Maps
inferred← citeshttps://doi.org/10.1137/s0097539793244368openalex-snapshot
Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
inferred← citeshttps://doi.org/10.1137/s0097539793252080openalex-snapshot
Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
inferred← citeshttps://doi.org/10.1137/s0097539793254376openalex-snapshot
Dynamic Trees and Dynamic Point Location
inferred← citeshttps://doi.org/10.1142/s0129054111008805openalex-snapshot
PROCESSING AN OFFLINE INSERTION-QUERY SEQUENCE WITH APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218195902000803openalex-snapshot
ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195902000918openalex-snapshot
OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0218195905001889openalex-snapshot
EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195910003256openalex-snapshot
FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE
inferred← citeshttps://doi.org/10.1142/s021819592050003xopenalex-snapshot
Dynamic Algorithms for Visibility Polygons in Simple Polygons
inferred← citeshttps://doi.org/10.1142/s0218195995000131openalex-snapshot
TRANSLATION QUERIES FOR SETS OF POLYGONS
inferred← citeshttps://doi.org/10.1142/s021819599800014xopenalex-snapshot
Determining Weak Visibility of a Polygon from an Edge in Parallel
inferred← citeshttps://doi.org/10.1142/s179383092250063xopenalex-snapshot
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
inferred← citeshttps://doi.org/10.1145/103418.103472openalex-snapshot
Dynamic trees and dynamic point location
inferred← citeshttps://doi.org/10.1145/10515.10516openalex-snapshot
Linear time algorithms for visibility and shortest path problems inside simple polygons
inferred← citeshttps://doi.org/10.1145/1064092.1064145openalex-snapshot
Guarding a terrain by two watchtowers
inferred← citeshttps://doi.org/10.1145/109648.109651openalex-snapshot
Efficient ray shooting and hidden surface removal
inferred← citeshttps://doi.org/10.1145/122718.122725openalex-snapshot
Visibility preprocessing for interactive walkthroughs
inferred← citeshttps://doi.org/10.1145/129712.129763openalex-snapshot
Ray shooting and parametric search
inferred← citeshttps://doi.org/10.1145/142675.142687openalex-snapshot
Optimal parallel algorithms for triangulated simple polygons
inferred← citeshttps://doi.org/10.1145/142675.142692openalex-snapshot
An optimal parallel algorithm for detecting weak visibility of a simple polygon
inferred← citeshttps://doi.org/10.1145/142675.142737openalex-snapshot
Intersection detection and separators for simple polygons
inferred← citeshttps://doi.org/10.1145/160985.160987openalex-snapshot
Generalized hidden surface removal
inferred← citeshttps://doi.org/10.1145/160985.161157openalex-snapshot
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
inferred← citeshttps://doi.org/10.1145/160985.161160openalex-snapshot
Can visibility graphs be represented compactly?
inferred← citeshttps://doi.org/10.1145/2261250.2261270openalex-snapshot
Tracing compressed curves in triangulated surfaces
inferred← citeshttps://doi.org/10.1145/304893.304976openalex-snapshot
Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons
inferred← citeshttps://doi.org/10.1145/41958.41959openalex-snapshot
Computing the link center of a simple polygon
inferred← citeshttps://doi.org/10.1145/73393.73401openalex-snapshot
Red-Blue intersection detection algorithms, with applications to motion planning and collision detection
inferred← citeshttps://doi.org/10.1145/73393.73417openalex-snapshot
The furthest-site geodesic Voronoi diagram
inferred← citeshttps://doi.org/10.1145/98524.98536openalex-snapshot
Structured visibility profiles with applications to problems in simple polygons (extended abstract)
inferred← citeshttps://doi.org/10.1145/98524.98539openalex-snapshot
Parallel methods for visibility and shortest path problems in simple polygons (preliminary version)
inferred← citeshttps://doi.org/10.1145/98524.98600openalex-snapshot
On solving geometric optimization problems using shortest paths
inferred← citeshttps://doi.org/10.1145/997817.997825openalex-snapshot
Computing the visibility graph of points within a polygon
inferred← citeshttps://doi.org/10.15807/jorsj.45.145openalex-snapshot
A SCANLINE-BASED ALGORITHM FOR THE 2D FREE-FORM BIN PACKING PROBLEM
inferred← citeshttps://doi.org/10.1587/transfun.2022dmp0007openalex-snapshot
Enumerating Empty and Surrounding Polygons
inferred← citeshttps://doi.org/10.1587/transfun.e102.a.423openalex-snapshot
Characterizing Link-2 LR-Visibility Polygons and Related Problems
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1410778/v1openalex-snapshot
Begining of integration RATP model in LASER/F for thermo-radiative simulation of an urban district with vegetation
inferred← citeshttps://doi.org/10.21203/rs.3.rs-1410778/v2openalex-snapshot
Begining of integration RATP model in LASER/F for thermo-radiative simulation of an urban district with vegetation
inferred← citeshttps://doi.org/10.22215/etd/2023-15445openalex-snapshot
Constrained Geometric Optimization Problems
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5391openalex-snapshot
Parallel Geometric Algorithms.
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.293openalex-snapshot
L_1 Shortest Path Queries among Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1212.6039openalex-snapshot
Weak Visibility Queries of Line Segments in Simple Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1309.7803openalex-snapshot
Near Optimal Line Segment Weak Visibility Queries in Simple Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1008openalex-snapshot
Realistic and Efficient Channel Modeling for Vehicular Networks
inferred← citeshttps://doi.org/10.5555/313559.313610openalex-snapshot
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
inferred← citeshttps://doi.org/10.5555/313559.313611openalex-snapshot
A pedestrian approach to ray shooting: shoot a ray, take a walk
inferred← citeshttps://doi.org/10.5555/313559.313764openalex-snapshot
Ray shooting amidst convex polytopes in three dimensions
inferred← citeshttps://doi.org/10.5555/320176.320189openalex-snapshot
Applying parallel processing techniques to classification problems in constructive solid geometry
inferred← citeshttps://doi.org/10.5555/545381.545401openalex-snapshot
Motorcycle graphs and straight skeletons
inferred← citeshttps://doi.org/10.70675/9341688bz991cz49efz94bfzc035c9c8ce88openalex-snapshot
Optimisation des procédures de départ et d'arrivée dans une zone terminale
showing the first 200 of 201 · page through all 201
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.