On the public citation graph

Topologically sweeping visibility complexes via pseudotriangulations

https://doi.org/10.1007/bf02712876
0 signed · 144 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.1007/3-540-58950-3_366openalex-snapshot
Visibility graphs and oriented matroids (extended abstract)
inferredcites →https://doi.org/10.1007/978-1-4615-9763-6openalex-snapshot
Enumerative Combinatorics
inferredcites →https://doi.org/10.1007/978-3-642-58191-5openalex-snapshot
Greedoids
inferredcites →https://doi.org/10.1007/978-3-642-69672-5openalex-snapshot
Data Structures and Algorithms 1
inferredcites →https://doi.org/10.1007/978-94-011-0924-6_5openalex-snapshot
Modern Developments in Regular Polytopes
inferredcites →https://doi.org/10.1007/bf01553883openalex-snapshot
An optimal visibility graph algorithm for triangulated simple polygons
inferredcites →https://doi.org/10.1007/bf01840385openalex-snapshot
A fast algorithm for computing sparse visibility graphs
inferredcites →https://doi.org/10.1007/bf01840436openalex-snapshot
Visibility of disjoint polygons
inferredcites →https://doi.org/10.1007/bf02574385openalex-snapshot
Can visibility graphs Be represented compactly?
inferredcites →https://doi.org/10.1007/s00454-002-2881-6openalex-snapshot
Visibility Graphs and Oriented Matroids
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/0020-0190(88)90022-1openalex-snapshot
Time and space efficient algorithms for shortest paths between convex polygons
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/0022-0000(89)90038-xopenalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1016/0925-7721(95)00016-xopenalex-snapshot
Minimal tangent visibility graphs
inferredcites →https://doi.org/10.1016/s0019-9958(86)80033-xopenalex-snapshot
Sorting jordan sequences in linear time using level-linked search trees
inferredcites →https://doi.org/10.1017/cbo9780511805967openalex-snapshot
Enumerative Combinatorics
inferredcites →https://doi.org/10.1093/comjnl/27.2.97openalex-snapshot
Literate Programming
inferredcites →https://doi.org/10.1109/sfcs.1989.63531openalex-snapshot
Randomized search trees
inferredcites →https://doi.org/10.1137/0220055openalex-snapshot
An Output-Sensitive Algorithm for Computing Visibility Graphs
inferredcites →https://doi.org/10.1142/s0218195992000202openalex-snapshot
DISTANCE VISIBILITY GRAPHS
inferredcites →https://doi.org/10.1142/s0218195993000075openalex-snapshot
COMPUTATIONAL GEOMETRY COLUMN 18
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/147508.147511openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1145/160985.161159openalex-snapshot
The visibility complex
inferredcites →https://doi.org/10.1145/220279.220340openalex-snapshot
The visibility complex made visibly simple
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/73393.73410openalex-snapshot
New methods for computing visibility graphs
inferredcites →https://doi.org/10.1145/73393.73411openalex-snapshot
Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11618058_38openalex-snapshot
Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs
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-44438-6_30openalex-snapshot
A New Visibility Partition for Affine Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_55openalex-snapshot
Transforming Pseudo-Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-45071-8_45openalex-snapshot
On Constrained Minimum Pseudotriangulations
inferred← citeshttps://doi.org/10.1007/3-540-45643-0_12openalex-snapshot
Topological Sweep in Degenerate Cases
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_47openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot
Efficient Algorithms for Geometric Shortest Path Query Problems
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-031-63021-7_39openalex-snapshot
Efficient Computation of Crossing Components and Shortcut Hulls
inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_13openalex-snapshot
EL-Labelings and Canonical Spanning Trees for Subword Complexes
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-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-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-87744-8_67openalex-snapshot
On the Size of the 3D Visibility Skeleton: Experimental Results
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-27848-8_509-1openalex-snapshot
Geometric Shortest Paths in the Plane
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-55566-4_33openalex-snapshot
Expansive Motions and the Polytope of Pointed Pseudo-Triangulations
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/pl00009464openalex-snapshot
Flipping Edges in Triangulations
inferred← citeshttps://doi.org/10.1007/s00013-023-01895-6openalex-snapshot
Celebrating Loday’s associahedron
inferred← citeshttps://doi.org/10.1007/s00209-025-03688-9openalex-snapshot
Wigglyhedra
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-006-0669-9openalex-snapshot
Alternating Paths along Axis-Parallel Segments
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/s00454-001-0010-6openalex-snapshot
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set
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-004-1143-1openalex-snapshot
The Polytope of Non-Crossing Graphs on a Planar Point Set
inferred← citeshttps://doi.org/10.1007/s00454-005-1184-0openalex-snapshot
Acute Triangulations of Polygons
inferred← citeshttps://doi.org/10.1007/s00454-007-9032-zopenalex-snapshot
Pre-Triangulations and Liftable Complexes
inferred← citeshttps://doi.org/10.1007/s00454-012-9408-6openalex-snapshot
Multitriangulations, Pseudotriangulations and Primitive Sorting Networks
inferred← citeshttps://doi.org/10.1007/s00454-012-9447-zopenalex-snapshot
Computing Pseudotriangulations via Branched Coverings
inferred← citeshttps://doi.org/10.1007/s00454-019-00108-8openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
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.1016/j.advengsoft.2011.04.006openalex-snapshot
The stochastic walk algorithms for point location in pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.aim.2015.02.012openalex-snapshot
Brick polytopes of spherical subword complexes and generalized associahedra
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.07.003openalex-snapshot
Planar minimally rigid graphs and pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.09.002openalex-snapshot
Enumerating pseudo-triangulations in the plane
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.2014.08.003openalex-snapshot
Visibility and ray shooting queries in polygonal domains
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.10.004openalex-snapshot
Spiderman graph: Visibility in urban regions
inferred← citeshttps://doi.org/10.1016/j.dam.2011.07.026openalex-snapshot
Empty pseudo-triangles in point sets
inferred← citeshttps://doi.org/10.1016/j.disc.2005.09.045openalex-snapshot
Combinatorial pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.12.003openalex-snapshot
The brick polytope of a sorting network
inferred← citeshttps://doi.org/10.1016/j.iot.2019.100152openalex-snapshot
GROLL: Geographic Routing for Low Power and Lossy IoT Networks
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.021openalex-snapshot
Transforming pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.05.009openalex-snapshot
On planar path transformation
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.jestch.2021.03.002openalex-snapshot
Path planning of a mobile robot among curved obstacles through tangent drawing and trapezoidal decomposition
inferred← citeshttps://doi.org/10.1016/s0097-8493(99)00093-xopenalex-snapshot
Interactive ray tracing with the visibility complex
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(02)00172-4openalex-snapshot
Segment endpoint visibility graphs are Hamiltonian
inferred← citeshttps://doi.org/10.1017/9781009701259.020openalex-snapshot
On the Complexity of Visibility Problems with Moving Viewpoints
inferred← citeshttps://doi.org/10.1080/13658810500286935openalex-snapshot
Query processing in spatial databases containing obstacles
inferred← citeshttps://doi.org/10.1090/conm/453/08807openalex-snapshot
Pseudo-triangulations—a survey
inferred← citeshttps://doi.org/10.1090/dimacs/060/12openalex-snapshot
Combinatorial roadmaps in configuration spaces of simple planar polygons
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/sfcs.2000.892132openalex-snapshot
A combinatorial approach to planar non-colliding robot arm motion planning
inferred← citeshttps://doi.org/10.1137/050631008openalex-snapshot
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
inferred← citeshttps://doi.org/10.1137/1.9781611973730.107openalex-snapshot
Geometric k Shortest Paths
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/s0097539702411368openalex-snapshot
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
inferred← citeshttps://doi.org/10.1142/s0129626406002447openalex-snapshot
INHERENTLY PARALLEL GEOMETRIC COMPUTATIONS
inferred← citeshttps://doi.org/10.1142/s0218195903001098openalex-snapshot
SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
inferred← citeshttps://doi.org/10.1142/s0218195907002380openalex-snapshot
ON THE EXPECTED SIZE OF THE 2D VISIBILITY COMPLEX
inferred← citeshttps://doi.org/10.1142/s0218195912500082openalex-snapshot
LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS
inferred← citeshttps://doi.org/10.1145/1005285.1005322openalex-snapshot
The polytope of non-crossing graphs on a planar point set
inferred← citeshttps://doi.org/10.1145/1137856.1137899openalex-snapshot
Pre-triangulations and liftable complexes
inferred← citeshttps://doi.org/10.1145/1247069.1247094openalex-snapshot
Towards an implementation of the 3D visibility skeleton
inferred← citeshttps://doi.org/10.1145/1542362.1542417openalex-snapshot
Arrangements of double pseudolines
inferred← citeshttps://doi.org/10.1145/237218.237367openalex-snapshot
Flipping edges in triangulations
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.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/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.1145/2629659openalex-snapshot
A Low-Stretch-Guaranteed and Lightweight Geographic Routing Protocol for Large-Scale Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/2660771openalex-snapshot
Computing Shortest Paths among Curved Obstacles in the Plane
inferred← citeshttps://doi.org/10.1145/378583.378709openalex-snapshot
A sum of squares theorem for visibility
inferred← citeshttps://doi.org/10.1145/508357.508362openalex-snapshot
The 3D visibility complex
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/777792.777817openalex-snapshot
Planar minimally rigid graphs and pseudo-triangulations
inferred← citeshttps://doi.org/10.1145/777815.777817openalex-snapshot
Planar minimally rigid graphs and pseudo-triangulations
inferred← citeshttps://doi.org/10.1145/997817.997825openalex-snapshot
Computing the visibility graph of points within a polygon
inferred← citeshttps://doi.org/10.1145/997817.997887openalex-snapshot
The corner arc algorithm
inferred← citeshttps://doi.org/10.1177/027836402320556395openalex-snapshot
Deformable Free-Space Tilings for Kinetic Collision Detection†
inferred← citeshttps://doi.org/10.1201/9781584888215-c2openalex-snapshot
Computational Geometry II
inferred← citeshttps://doi.org/10.14288/1.0051704openalex-snapshot
All the distant horizon edges of a terrain
inferred← citeshttps://doi.org/10.1609/aimag.v34i4.2512openalex-snapshot
Any‐Angle Path Planning
inferred← citeshttps://doi.org/10.22215/etd/2016-11226openalex-snapshot
Discrete Geometric Path Analysis in Computational Geometry
inferred← citeshttps://doi.org/10.22215/etd/2019-13533openalex-snapshot
Shortest Paths Among Dynamic Obstacles
inferred← citeshttps://doi.org/10.3217/wr0km-v1e13openalex-snapshot
Relaxing and lifting triangulations
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.46298/dmtcs.2328openalex-snapshot
EL-labelings and canonical spanning trees for subword complexes
inferred← citeshttps://doi.org/10.48550/arxiv.1009.1605openalex-snapshot
Multitriangulations, pseudotriangulations and some problems of realization of polytopes
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5187openalex-snapshot
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1111.3349openalex-snapshot
Brick polytopes of spherical subword complexes and generalized associahedra
inferred← citeshttps://doi.org/10.48550/arxiv.1203.2323openalex-snapshot
The greedy flip tree of a subword complex
inferred← citeshttps://doi.org/10.48550/arxiv.1703.03048openalex-snapshot
Quickest Visibility Queries in Polygonal Domains
inferred← citeshttps://doi.org/10.48550/arxiv.2011.09925openalex-snapshot
Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.math/0607171openalex-snapshot
Planar pseudo-triangulations, spherical pseudo-tilings and hyperbolic virtual polytopes
inferred← citeshttps://doi.org/10.5555/644108.644128openalex-snapshot
Allocating vertex π-guards in simple polygons via pseudo-triangulations
inferred← citeshttps://doi.org/10.82308/31561openalex-snapshot
On the three-dimensional visibility skeleton: implementation and analysis
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.