On the public citation graph

Ray shooting in polygons using geodesic triangulations

https://doi.org/10.1007/bf01377183
0 signed · 179 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.
Claim with ORCID
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.
See reference health

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.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-69672-5openalex-snapshot
Data Structures and Algorithms 1
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/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.1007/bf02187720openalex-snapshot
The complexity of cutting complexes
inferredcites →https://doi.org/10.1007/bf02187747openalex-snapshot
Visibility and intersection problems in plane geometry
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1007/bfb0040379openalex-snapshot
On finding lowest common ancestors: Simplification and parallelization
inferredcites →https://doi.org/10.1016/0020-0190(91)90064-oopenalex-snapshot
A new data structure for shortest path queries in a simple polygon
inferredcites →https://doi.org/10.1016/0022-0000(81)90012-xopenalex-snapshot
Maintenance of configurations in the plane
inferredcites →https://doi.org/10.1016/0022-0000(89)90041-xopenalex-snapshot
Optimal shortest path queries in a simple polygon
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/0304-3975(82)90120-7openalex-snapshot
Fast detection of polyhedral intersection
inferredcites →https://doi.org/10.1109/sfcs.1982.58openalex-snapshot
A theorem on polygon cutting with applications
inferredcites →https://doi.org/10.1137/0212002openalex-snapshot
Optimal Search in Planar Subdivisions
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1142/s0218195991000025openalex-snapshot
COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
inferredcites →https://doi.org/10.1145/73833.73868openalex-snapshot
Ray shooting and other applications of spanning trees with low stabbing number
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20025openalex-snapshot
Data structures for maintaining set partitions
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.1996.0056openalex-snapshot
Ray Shooting Amidst Convex Polygons in 2D
inferred← citeshttps://doi.org/10.1006/jagm.2000.1092openalex-snapshot
Safety Zone Problem
inferred← citeshttps://doi.org/10.1007/10991541_13openalex-snapshot
Pareto Optimal Coordination on Roadmaps
inferred← citeshttps://doi.org/10.1007/11821069_8openalex-snapshot
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_9openalex-snapshot
Data Structures for Maintaining Set Partitions
inferred← citeshttps://doi.org/10.1007/3-540-58218-5_1openalex-snapshot
Computing depth orders and related problems
inferred← citeshttps://doi.org/10.1007/978-1-4471-2256-2_5openalex-snapshot
Partitioning a Polygon or the Plane
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_34openalex-snapshot
Does a Robot Path Have Clearance C?
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_9openalex-snapshot
Augmenting Plane Straight-Line Graphs to Meet Parity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_1openalex-snapshot
Guarding a 1.5D Terrain with Imprecise Viewpoints
inferred← citeshttps://doi.org/10.1007/978-3-031-98740-3_6openalex-snapshot
Monotone Partitions of Simple Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_38openalex-snapshot
Pointed Binary Encompassing Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-30538-5_25openalex-snapshot
Minimum weight pseudo-triangulations (Extended abstract)
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-45078-8_2openalex-snapshot
Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips
inferred← citeshttps://doi.org/10.1007/978-3-540-45078-8_33openalex-snapshot
The Zigzag Path of a Pseudo-Triangulation
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-540-77120-3_57openalex-snapshot
Geodesic Disks and Clustering in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_65openalex-snapshot
Relative Convex Hulls in Semi-dynamic Subdivisions
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_5openalex-snapshot
Algorithms for Computing Diffuse Reflection Paths in Polygons
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_46openalex-snapshot
Resolving Loads with Positive Interior Stresses
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_15openalex-snapshot
Multi Cover of a Polygon Minimizing the Sum of Areas
inferred← citeshttps://doi.org/10.1007/978-3-642-21931-3_3openalex-snapshot
Construction of Pseudo-triangulation by Incremental Insertion
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_20openalex-snapshot
Beyond Triangulation: Covering Polygons with Triangles
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_63openalex-snapshot
Weak Visibility Queries of Line Segments in Simple Polygons
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-40164-0_21openalex-snapshot
New Sequential and Parallel Algorithms for Computing the β-Spectrum
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_30openalex-snapshot
Terrain Visibility with Multiple Viewpoints
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_5openalex-snapshot
A Sum of Squares Theorem for Visibility Complexes and Applications
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_33openalex-snapshot
Trajectory Visibility at First Sight
inferred← citeshttps://doi.org/10.1007/bfb0009507openalex-snapshot
k-pairs non-crossing shortest paths in a simple polygon
inferred← citeshttps://doi.org/10.1007/pl00009271openalex-snapshot
Computing Vision Points in Polygons
inferred← citeshttps://doi.org/10.1007/s00371-011-0670-zopenalex-snapshot
Algorithms for computing diffuse reflection paths in polygons
inferred← citeshttps://doi.org/10.1007/s00373-007-0752-xopenalex-snapshot
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
inferred← citeshttps://doi.org/10.1007/s00453-009-9329-9openalex-snapshot
Minimum Weight Convex Steiner Partitions
inferred← citeshttps://doi.org/10.1007/s00453-012-9679-6openalex-snapshot
Relative Convex Hulls in Semi-Dynamic Arrangements
inferred← citeshttps://doi.org/10.1007/s00453-017-0299-zopenalex-snapshot
Stabbing Circles for Sets of Segments in the Plane
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/s00453-019-00651-zopenalex-snapshot
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00454-002-2886-1openalex-snapshot
New Similarity Measures between Polylines with Applications to Morphing and Polygon Sweeping
inferred← citeshttps://doi.org/10.1007/s00454-004-1091-9openalex-snapshot
Allocating Vertex ?-Guards in Simple Polygons via Pseudo-Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-011-9341-0openalex-snapshot
Binary Plane Partitions for Disjoint Line Segments
inferred← citeshttps://doi.org/10.1007/s00454-014-9625-2openalex-snapshot
A Faster Algorithm for Computing Motorcycle Graphs
inferred← citeshttps://doi.org/10.1007/s00454-019-00063-4openalex-snapshot
Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s00454-019-00108-8openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.1007/s00454-022-00404-wopenalex-snapshot
How to Cut Corners and Get Bounded Convex Curvature
inferred← citeshttps://doi.org/10.1007/s00454-022-00424-6openalex-snapshot
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
inferred← citeshttps://doi.org/10.1007/s00454-024-00709-yopenalex-snapshot
Algorithms for Halfplane Coverage and Related Problems
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/j.advengsoft.2011.04.006openalex-snapshot
The stochastic walk algorithms for point location in pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2003.11.001openalex-snapshot
Kinetic collision detection between two simple polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.002openalex-snapshot
Convexity minimizes pseudo-triangulations
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.2006.12.005openalex-snapshot
Pointed binary encompassing trees: Simple and optimal
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.05.004openalex-snapshot
Minimum weight pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.10.005openalex-snapshot
Decomposing a simple polygon into pseudo-triangles and convex polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.06.005openalex-snapshot
A vertex-face assignment for plane graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.08.002openalex-snapshot
Draining a polygon—or—rolling a ball out of a polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.11.001openalex-snapshot
A kinetic triangulation scheme for moving points in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.09.001openalex-snapshot
On k-convex polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.12.005openalex-snapshot
Minimum-link paths revisited
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.comgeo.2017.05.003openalex-snapshot
Linear transformation distance for bichromatic matchings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.05.005openalex-snapshot
Routing in a polygonal terrain with the shortest beacon watchtower
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.02.001openalex-snapshot
Faster algorithms for growing prioritized disks and rectangles
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.05.001openalex-snapshot
Computing a geodesic two-center of points in a simple polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.07.002openalex-snapshot
Partially walking a polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.101595openalex-snapshot
Self-approaching paths in simple polygons
inferred← citeshttps://doi.org/10.1016/j.dam.2020.03.034openalex-snapshot
Algorithmic enumeration of surrounding polygons
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.045openalex-snapshot
Combinatorial pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.09.005openalex-snapshot
Kinetic collision detection with fast flight plan changes
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106362openalex-snapshot
On Voronoi visibility maps of 1.5D terrains with multiple viewpoints
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.07.003openalex-snapshot
Lower bounds for intersection searching and fractional cascading in higher dimension
inferred← citeshttps://doi.org/10.1016/j.jcta.2007.06.002openalex-snapshot
On the number of pseudo-triangulations of certain point sets
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.033openalex-snapshot
New sequential and parallel algorithms for computing the β-spectrum
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.018openalex-snapshot
Largest triangle inside a terrain
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114724openalex-snapshot
Uniformly monotone partitioning of polygons
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00235-8openalex-snapshot
Finding the shortest boundary guard of a simple polygon
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00011-0openalex-snapshot
Computing simple paths among obstacles
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(02)00126-8openalex-snapshot
Tight degree bounds for pseudo-triangulations of points
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/9781108592376.015openalex-snapshot
Covering geometric domains
inferred← citeshttps://doi.org/10.1090/conm/453/08807openalex-snapshot
Pseudo-triangulations—a survey
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00072openalex-snapshot
2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.1137/040609860openalex-snapshot
Nonpositive Curvature and Pareto Optimal Coordination of Robots
inferred← citeshttps://doi.org/10.1137/050631008openalex-snapshot
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
inferred← citeshttps://doi.org/10.1137/100804310openalex-snapshot
Shooting Permanent Rays among Disjoint Polygons in the Plane
inferred← citeshttps://doi.org/10.1137/16m1079695openalex-snapshot
Peeling Potatoes Near-Optimally in Near-Linear Time
inferred← citeshttps://doi.org/10.1137/18m1218194openalex-snapshot
Adaptive Planar Point Location
inferred← citeshttps://doi.org/10.1137/21m1428248openalex-snapshot
A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane
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/s0097539702411368openalex-snapshot
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
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/s009753979426616xopenalex-snapshot
Computing Many Faces in Arrangements of Lines and Segments
inferred← citeshttps://doi.org/10.1142/s0218195902000724openalex-snapshot
KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s021819590200075xopenalex-snapshot
AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
inferred← citeshttps://doi.org/10.1142/s0218195902000803openalex-snapshot
ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
inferred← citeshttps://doi.org/10.1142/s0218195902000864openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 43
inferred← citeshttps://doi.org/10.1142/s0218195911003822openalex-snapshot
GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON
inferred← citeshttps://doi.org/10.1142/s021819591100386xopenalex-snapshot
MULTI COVER OF A POLYGON MINIMIZING THE SUM OF AREAS
inferred← citeshttps://doi.org/10.1142/s0218195914600048openalex-snapshot
A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS
inferred← citeshttps://doi.org/10.1142/s0218195914600085openalex-snapshot
TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
inferred← citeshttps://doi.org/10.1142/s0218195917500017openalex-snapshot
Minimum Cell Connection in Line Segment Arrangements
inferred← citeshttps://doi.org/10.1142/s0218195998000023openalex-snapshot
An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
inferred← citeshttps://doi.org/10.1142/s0218195999000315openalex-snapshot
k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
inferred← citeshttps://doi.org/10.1145/1071246.1071258openalex-snapshot
Dynamic topological predicates and notifications in moving objects databases
inferred← citeshttps://doi.org/10.1145/1542362.1542372openalex-snapshot
Shooting permanent rays among disjoint polygons in the plane
inferred← citeshttps://doi.org/10.1145/1542362.1542375openalex-snapshot
Binary plane partitions for disjoint line segments
inferred← citeshttps://doi.org/10.1145/1810959.1810985openalex-snapshot
A kinetic triangulation scheme for moving points in the plane
inferred← citeshttps://doi.org/10.1145/1998196.1998274openalex-snapshot
Exact workspace boundary by extremal reaches
inferred← citeshttps://doi.org/10.1145/2462356.2462374openalex-snapshot
A near-optimal algorithm for shortest paths among curved obstacles in the plane
inferred← citeshttps://doi.org/10.1145/2462356.2462396openalex-snapshot
A faster algorithm for computing motorcycle graphs
inferred← citeshttps://doi.org/10.1145/2582112.2582159openalex-snapshot
Peeling Potatoes Near-Optimally in Near-Linear Time
inferred← citeshttps://doi.org/10.1145/3046673openalex-snapshot
Instance-Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.1145/336154.336212openalex-snapshot
An algorithm for searching a polygonal region with a flashlight
inferred← citeshttps://doi.org/10.1145/336154.336219openalex-snapshot
Kinetic collision detection for simple polygons
inferred← citeshttps://doi.org/10.1145/3487403openalex-snapshot
Dynamic Distribution-Sensitive Point Location
inferred← citeshttps://doi.org/10.1145/380752.380818openalex-snapshot
Lower bounds for intersection searching and fractional cascading in higher dimension
inferred← citeshttps://doi.org/10.1145/507457.507468openalex-snapshot
Computational geometry column 43
inferred← citeshttps://doi.org/10.1145/513400.513423openalex-snapshot
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
inferred← citeshttps://doi.org/10.1145/513400.513442openalex-snapshot
Pseudotriangulations, polytopes, and how to expand linkages
inferred← citeshttps://doi.org/10.1145/777792.777816openalex-snapshot
Spatial embedding of pseudo-triangulations
inferred← citeshttps://doi.org/10.1145/780542.780612openalex-snapshot
Touring a sequence of polygons
inferred← citeshttps://doi.org/10.1177/0278364905059057openalex-snapshot
Computing Pareto Optimal Coordinations on Roadmaps
inferred← citeshttps://doi.org/10.1587/transfun.2022dmp0007openalex-snapshot
Enumerating Empty and Surrounding Polygons
inferred← citeshttps://doi.org/10.17169/refubium-16284openalex-snapshot
Lifting planar graphs to realize integral 3-polytopes and topics in pseudo- triangulations
inferred← citeshttps://doi.org/10.20382/jocg.v5i1a2openalex-snapshot
The Hausdorff core problem on simple polygons
inferred← citeshttps://doi.org/10.20382/jocg.v7i2a5openalex-snapshot
Shortest Path to a Segment and Quickest Visibility Queries
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.25781/kaust-yn9r1openalex-snapshot
Algorithms for Computing Motorcycle Graphs
inferred← citeshttps://doi.org/10.31274/rtd-180813-9863openalex-snapshot
Algorithms for security in robotics and networks
inferred← citeshttps://doi.org/10.3217/wr0km-v1e13openalex-snapshot
Relaxing and lifting triangulations
inferred← citeshttps://doi.org/10.33540/1081openalex-snapshot
Algorithmic and Experimental Results on Trajectory Data Processing
inferred← citeshttps://doi.org/10.3929/ethz-a-007018092openalex-snapshot
Discrete Descriptions of Geometric Objects
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.52openalex-snapshot
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.59openalex-snapshot
An Optimal Deterministic Algorithm for Geodesic Farthest-Point Voronoi Diagrams in Simple Polygons
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.1005.0912openalex-snapshot
A Kinetic Triangulation Scheme for Moving Points in The Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4618openalex-snapshot
Minimum cell connection and separation in line segment arrangements
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.1302.3091openalex-snapshot
Minimum-Link Paths Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1303.5958openalex-snapshot
A Faster Algorithm for Computing Motorcycle Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1505.00184openalex-snapshot
Instance Optimal Geometric Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03048openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.48550/arxiv.1809.10269openalex-snapshot
Global Curve Simplification
inferred← citeshttps://doi.org/10.48550/arxiv.1810.00715openalex-snapshot
Adaptive Planar Point Location
inferred← citeshttps://doi.org/10.48550/arxiv.2009.05541openalex-snapshot
2D Fractional Cascading on Axis-aligned Planar Subdivisions
inferred← citeshttps://doi.org/10.5555/365411.365564openalex-snapshot
Morphing between polylines
inferred← citeshttps://doi.org/10.5555/644108.644128openalex-snapshot
Allocating vertex π-guards in simple polygons via pseudo-triangulations
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.