On the public citation graph
Polyline‐sourced Geodesic Voronoi Diagrams on Triangle Meshes
0 signed · 46 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/bf01840347openalex-snapshot
A cautious scheduler for multistep transactions
inferredcites →https://doi.org/10.1007/bf01840357openalex-snapshot
A sweepline algorithm for Voronoi diagrams
inferredcites →https://doi.org/10.1007/s00371-007-0136-5openalex-snapshot
Handling degenerate cases in exact geodesic computation on triangle meshes
inferredcites →https://doi.org/10.1016/0010-4485(95)99797-copenalex-snapshot
Representing the Voronoi diagram of a simple polygon using rational quadratic Bézier curves
inferredcites →https://doi.org/10.1016/0021-9991(85)90140-8openalex-snapshot
On the construction of the Voronoi mesh on a sphere
inferredcites →https://doi.org/10.1016/j.cad.2011.08.027openalex-snapshot
Efficiently computing geodesic offsets on triangle meshes by the extended Xin–Wang algorithm
inferredcites →https://doi.org/10.1016/j.cad.2012.11.005openalex-snapshot
Exact geodesic metric in 2-manifold triangle meshes using edge-based data structures
inferredcites →https://doi.org/10.1016/j.ipl.2012.12.010openalex-snapshot
The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
inferredcites →https://doi.org/10.1016/s0010-4485(98)00052-9openalex-snapshot
A cocktail algorithm for planar bézier curve intersections
inferredcites →https://doi.org/10.1016/s0925-7721(02)00077-9openalex-snapshot
Voronoi diagrams on the sphere
inferredcites →https://doi.org/10.1073/pnas.95.15.8431openalex-snapshot
Computing geodesic paths on manifolds
inferredcites →https://doi.org/10.1109/70.678452openalex-snapshot
Multivalued distance maps for motion planning on surfaces with moving obstacles
inferredcites →https://doi.org/10.1109/cgi.1997.601311openalex-snapshot
Geodesic Voronoi diagrams on parametric surfaces
inferredcites →https://doi.org/10.1109/tpami.2010.221openalex-snapshot
Construction of Iso-Contours, Bisectors, and Voronoi Diagrams on Triangulated Surfaces
inferredcites →https://doi.org/10.1111/j.1467-8659.2012.03058.xopenalex-snapshot
Centroidal Voronoi Tessellation of Line Segments and Graphs
inferredcites →https://doi.org/10.1145/1073204.1073228openalex-snapshot
Fast exact and approximate geodesics on meshes
inferredcites →https://doi.org/10.1145/1559755.1559758openalex-snapshot
On centroidal voronoi tessellation—energy smoothness and fast computation
inferredcites →https://doi.org/10.1145/2077378.2077407openalex-snapshot
Constant-time O (1) all pairs geodesic distance query on triangle meshes
inferredcites →https://doi.org/10.1145/2159616.2159622openalex-snapshot
Constant-time all-pairs geodesic distance query on triangle meshes
inferredcites →https://doi.org/10.1145/2516971.2516977openalex-snapshot
Geodesics in heat: A new approach to computing distance based on heat flow
inferredcites →https://doi.org/10.1145/73393.73407openalex-snapshot
A geometric consistency theorem for a symbolic perturbation scheme
inferredcites →https://doi.org/10.1145/77635.77639openalex-snapshot
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
inferredcites →https://doi.org/10.48550/arxiv.1303.6493openalex-snapshot
Constructing Intrinsic Delaunay Triangulations of Submanifolds
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s41095-015-0022-4openalex-snapshot
A unified framework for isotropic meshing based on narrow-band Euclidean distance transformation
inferred← citeshttps://doi.org/10.1007/s41095-022-0326-0openalex-snapshot
An efficient algorithm for approximate Voronoi diagram construction on triangulated surfaces
inferred← citeshttps://doi.org/10.1016/j.cad.2017.05.022openalex-snapshot
An optimization-driven approach for computing geodesic paths on triangle meshes
inferred← citeshttps://doi.org/10.1016/j.cad.2018.04.021openalex-snapshot
Lightweight preprocessing and fast query of geodesic distance via proximity graph
inferred← citeshttps://doi.org/10.1016/j.cad.2022.103333openalex-snapshot
An Accuracy Controllable and Memory Efficient Method for Computing High-Quality Geodesic Distances on Triangle Meshes
inferred← citeshttps://doi.org/10.1016/j.gmod.2023.101196openalex-snapshot
GBGVD: Growth-based geodesic Voronoi diagrams
inferred← citeshttps://doi.org/10.1016/j.tws.2022.109974openalex-snapshot
A new stress-driven composite porous structure design method based on triply periodic minimal surfaces
inferred← citeshttps://doi.org/10.1080/15481603.2023.2171703openalex-snapshot
Exact Voronoi diagram for topographic spatial analysis
inferred← citeshttps://doi.org/10.1109/lra.2019.2899920openalex-snapshot
Energy-Efficient Coverage Path Planning for General Terrain Surfaces
inferred← citeshttps://doi.org/10.1109/tvcg.2019.2904271openalex-snapshot
Optimal Path Maps on the GPU
inferred← citeshttps://doi.org/10.1109/tvcg.2025.3531445openalex-snapshot
Towards Voronoi Diagrams of Surface Patches
inferred← citeshttps://doi.org/10.1111/cgf.13248openalex-snapshot
Fast and Memory‐Efficient Voronoi Diagram Construction on Triangle Meshes
inferred← citeshttps://doi.org/10.1145/2999532openalex-snapshot
Constructing Intrinsic Delaunay Triangulations from the Dual of Geodesic Voronoi Diagrams
inferred← citeshttps://doi.org/10.1145/3144567openalex-snapshot
Fast Construction of Discrete Geodesic Graphs
inferred← citeshttps://doi.org/10.26599/tst.2024.9010181openalex-snapshot
An Accurate and Time-Efficient Algorithm for Computing Isoline Sourced from Polylines on Triangle Meshes
inferred← citeshttps://doi.org/10.32657/10356/143580openalex-snapshot
Parallel discrete geodesic algorithms
inferred← citeshttps://doi.org/10.32657/10356/72861openalex-snapshot
Parallel computation of discrete geodesics and its applications
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.