On the public citation graph
Flipping Edges in Triangulations
0 signed · 151 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/bf01944353openalex-snapshot
Generating Rooted Triangulations Without Repetitions
inferredcites →https://doi.org/10.1007/bf01975867openalex-snapshot
Incremental topological flipping works for regular triangulations
inferredcites →https://doi.org/10.1007/bf02712876openalex-snapshot
Topologically sweeping visibility complexes via pseudotriangulations
inferredcites →https://doi.org/10.1007/s004539900013openalex-snapshot
Incremental Topological Flipping Works for Regular Triangulations
inferredcites →https://doi.org/10.1016/0196-6774(87)90048-4openalex-snapshot
The rotation graph of binary trees is Hamiltonian
inferredcites →https://doi.org/10.1016/b978-0-12-587260-7.50011-xopenalex-snapshot
Software for C1 Surface Interpolation
inferredcites →https://doi.org/10.1016/s0195-6698(89)80072-1openalex-snapshot
The Associahedron and Triangulations of the n-gon
inferredcites →https://doi.org/10.1090/dimacs/004/35openalex-snapshot
Regular triangulations of convex polytopes
inferredcites →https://doi.org/10.1137/0913058openalex-snapshot
An $O(n^2 \log n)$ Time Algorithm for the Minmax Angle Triangulation
inferredcites →https://doi.org/10.1142/9789812831699_0003openalex-snapshot
MESH GENERATION AND OPTIMAL TRIANGULATION
inferredcites →https://doi.org/10.1142/9789812831699_0007openalex-snapshot
VORONOI DIAGRAMS and DELAUNAY TRIANGULATIONS
inferredcites →https://doi.org/10.1145/237218.237409openalex-snapshot
The graph of triangulations of a convex polygon
inferredcites →https://doi.org/10.1201/9781420035315.ch23openalex-snapshot
Voronoi Diagrams and Delaunay Triangulations
inferredcites →https://doi.org/10.3217/jucs-002-08-0570openalex-snapshot
The Edge-Flipping Distance of Triangulations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20214openalex-snapshot
Simultaneous diagonal flips in plane triangulations
inferred← citeshttps://doi.org/10.1002/oca.2993openalex-snapshot
A mesh‐based partitioning algorithm for decreasing conservatism in solving bilinear matrix inequality problems
inferred← citeshttps://doi.org/10.1007/3-540-44860-8_55openalex-snapshot
Transforming Pseudo-Triangulations
inferred← citeshttps://doi.org/10.1007/3-540-44968-x_6openalex-snapshot
On Local Transformation of Polygons with Visibility Properties
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_19openalex-snapshot
The construction of Delaunay diagrams by lob reduction
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_12openalex-snapshot
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_16openalex-snapshot
Counting Plane Graphs: Flippability and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-61792-9_18openalex-snapshot
Flips in Higher Order Delaunay Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-030-76798-3_6openalex-snapshot
On Decomposition of Embedded Prismatoids in $$\mathbb {R}^3$$ Without Additional Points
inferred← citeshttps://doi.org/10.1007/978-3-031-20624-5_44openalex-snapshot
Complexity Results on Untangling Red-Blue Matchings
inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_10openalex-snapshot
On the Longest Flip Sequence to Untangle Segments in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-031-75409-8_23openalex-snapshot
On the Connectivity of the Flip Graph of Plane Spanning Paths
inferred← citeshttps://doi.org/10.1007/978-3-319-48532-4_25openalex-snapshot
The Mathematics of Ferran Hurtado: A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_3openalex-snapshot
On Local Transformations in Plane Geometric Graphs Embedded on Small Grids
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_15openalex-snapshot
Connectivity of Graphs Under Edge Flips
inferred← citeshttps://doi.org/10.1007/978-3-540-31843-9_1openalex-snapshot
Reconfiguring Triangulations with Edge Flips and Point Moves
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-73545-8_25openalex-snapshot
Enumerating Constrained Non-crossing Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_44openalex-snapshot
Counting Plane Graphs: Flippability and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-34191-5_13openalex-snapshot
Simultaneously Flippable Edges in Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_2openalex-snapshot
Flip Distance between Triangulations of a Simple Polygon is NP-Complete
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_42openalex-snapshot
The Flip Diameter of Rectangulations and Convex Subdivisions
inferred← citeshttps://doi.org/10.1007/978-981-97-0566-5_13openalex-snapshot
Short Flip Sequences to Untangle Segments in the Plane
inferred← citeshttps://doi.org/10.1007/s00022-011-0076-0openalex-snapshot
A generalized Winternitz Theorem
inferred← citeshttps://doi.org/10.1007/s00026-018-0393-1openalex-snapshot
Once Punctured Disks, Non-Convex Polygons, and Pointihedra
inferred← citeshttps://doi.org/10.1007/s00208-005-0643-5openalex-snapshot
Non-connected toric Hilbert schemes
inferred← citeshttps://doi.org/10.1007/s00211-015-0732-7openalex-snapshot
Adaptive, anisotropic and hierarchical cones of discrete convex functions
inferred← citeshttps://doi.org/10.1007/s00373-004-0555-2openalex-snapshot
A Note on Convex Decompositions of a Set of Points in the Plane
inferred← citeshttps://doi.org/10.1007/s00373-005-0615-2openalex-snapshot
Graphs of Triangulations and Perfect Matchings
inferred← citeshttps://doi.org/10.1007/s00373-007-0750-zopenalex-snapshot
Gray Code Enumeration of Plane Straight-Line Graphs
inferred← citeshttps://doi.org/10.1007/s00373-012-1229-0openalex-snapshot
Flip Graphs of Bounded Degree Triangulations
inferred← citeshttps://doi.org/10.1007/s00373-019-02081-8openalex-snapshot
On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets
inferred← citeshttps://doi.org/10.1007/s00373-021-02346-1openalex-snapshot
Quadrangulations of a Polygon with Spirality
inferred← citeshttps://doi.org/10.1007/s00454-007-9032-zopenalex-snapshot
Pre-Triangulations and Liftable Complexes
inferred← citeshttps://doi.org/10.1007/s00454-009-9164-4openalex-snapshot
Fast Enumeration Algorithms for Non-crossing Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s00454-015-9693-yopenalex-snapshot
Edge Flips in Surface Meshes
inferred← citeshttps://doi.org/10.1007/s00454-015-9709-7openalex-snapshot
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
inferred← citeshttps://doi.org/10.1007/s00454-017-9867-xopenalex-snapshot
Computing the Flip Distance Between Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-018-0035-8openalex-snapshot
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations
inferred← citeshttps://doi.org/10.1007/s00454-020-00251-7openalex-snapshot
Counting Polygon Triangulations is Hard
inferred← citeshttps://doi.org/10.1007/s00454-022-00436-2openalex-snapshot
Connectivity of Triangulation Flip Graphs in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-023-00596-9openalex-snapshot
An $$\mathcal {O}(3.82^{k})$$ Time $$\textsf {FPT}$$ Algorithm for Convex Flip Distance
inferred← citeshttps://doi.org/10.1007/s00454-024-00691-5openalex-snapshot
Erdős–Szekeres-Type Problems in the Real Projective Plane
inferred← citeshttps://doi.org/10.1007/s00454-025-00785-8openalex-snapshot
Reconfiguration of Plane Trees in Convex Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s10878-012-9480-0openalex-snapshot
Flipping triangles and rectangles
inferred← citeshttps://doi.org/10.1007/s11280-019-00716-7openalex-snapshot
Preserving location privacy using three layer RDV masking in geocoded published discrete point data
inferred← citeshttps://doi.org/10.1016/j.aim.2019.106939openalex-snapshot
Minimal surfaces from infinitesimal deformations of circle packings
inferred← citeshttps://doi.org/10.1016/j.aim.2024.110055openalex-snapshot
Order-2 Delaunay triangulations optimize angles
inferred← citeshttps://doi.org/10.1016/j.cam.2018.06.029openalex-snapshot
Hamiltonian triangular refinements and space-filling curves
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.004openalex-snapshot
On local transformations in plane geometric graphs embedded on small grids
inferred← citeshttps://doi.org/10.1016/j.comgeo.2007.07.006openalex-snapshot
Triangulations without pointed spanning trees
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.01.001openalex-snapshot
Flip distance between triangulations of a planar point set is APX-hard
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.08.009openalex-snapshot
Bichromatic compatible matchings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.11.001openalex-snapshot
Flip distance between two triangulations of a point set is NP-complete
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.08.003openalex-snapshot
Convex blocking and partial orders on the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.08.001openalex-snapshot
Flips in edge-labelled pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2017.06.005openalex-snapshot
Flipping edge-labelled triangulations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2019.01.008openalex-snapshot
Flip distance to some plane configurations
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101974openalex-snapshot
Complexity results on untangling red-blue matchings
inferred← citeshttps://doi.org/10.1016/j.comgeo.2026.102277openalex-snapshot
Flip equivalence of ortho-unit polygons
inferred← citeshttps://doi.org/10.1016/j.compstruct.2018.09.006openalex-snapshot
Optimized finite element analysis model based on terrestrial laser scanning data
inferred← citeshttps://doi.org/10.1016/j.dam.2009.04.019openalex-snapshot
Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.027openalex-snapshot
Flip paths between lattice triangulations
inferred← citeshttps://doi.org/10.1016/j.ejc.2016.12.002openalex-snapshot
Counting triangulations of some classes of subdivided convex polygons
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104248openalex-snapshot
Flips in two-dimensional hypertriangulations
inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.084openalex-snapshot
Flip Graphs of Bounded-Degree Triangulations
inferred← citeshttps://doi.org/10.1016/j.endm.2018.06.011openalex-snapshot
Geometric quadrangulations of a polygon
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104708openalex-snapshot
An improved FPT algorithm for the flip distance problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.021openalex-snapshot
Transforming pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.09.003openalex-snapshot
Transforming spanning trees and pseudo-triangulations
inferred← citeshttps://doi.org/10.1016/j.jcta.2013.01.002openalex-snapshot
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleynʼs technique
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.031openalex-snapshot
Minimum weight connectivity augmentation for planar straight-line graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00008-9openalex-snapshot
An efficient upper bound of the rotation distance of binary trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00409-1openalex-snapshot
On local transformation of polygons with visibility properties
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00111-6openalex-snapshot
An efficient algorithm for enumeration of triangulations
inferred← citeshttps://doi.org/10.1021/acs.cgd.7b00853openalex-snapshot
Defining the Role of Silicon Substrate Orientation on the Polycrystalline Diamond Film: A Novel Approach for Characterizing Faceted Microstructures
inferred← citeshttps://doi.org/10.1063/1.5130820openalex-snapshot
Temperature field distribution in spoke-type permanent magnet synchronous machines
inferred← citeshttps://doi.org/10.1080/00207160500069870openalex-snapshot
An efficient algorithm for estimating rotation distance between two binary trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxq040openalex-snapshot
An Optimal Rotation Distance Set
inferred← citeshttps://doi.org/10.1109/cit.2017.44openalex-snapshot
The Enumeration of Flippable Edges in Maximal Planar Graphs
inferred← citeshttps://doi.org/10.1109/csse.2008.337openalex-snapshot
Diagonal-Flip Distance Algorithms of Three Type Triangulations
inferred← citeshttps://doi.org/10.1109/etfa.2017.8247736openalex-snapshot
Incremental 2D Delaunay triangulation core implementation on FPGA for surface reconstruction via high-level synthesis
inferred← citeshttps://doi.org/10.1137/050631008openalex-snapshot
Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
inferred← citeshttps://doi.org/10.1137/070697987openalex-snapshot
Transforming Triangulations on Nonplanar Surfaces
inferred← citeshttps://doi.org/10.1137/1.9781611975994.172openalex-snapshot
Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)
inferred← citeshttps://doi.org/10.1137/s0097539702411368openalex-snapshot
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
inferred← citeshttps://doi.org/10.1139/juvs-2018-0015openalex-snapshot
Structural mapping of rock walls imaged with a LiDAR mounted on an unmanned aircraft system
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/s0218195914600036openalex-snapshot
FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR
inferred← citeshttps://doi.org/10.1145/1137856.1137899openalex-snapshot
Pre-triangulations and liftable complexes
inferred← citeshttps://doi.org/10.1145/1247069.1247084openalex-snapshot
Happy endings for flip graphs
inferred← citeshttps://doi.org/10.1145/1377676.1377733openalex-snapshot
Fast enumeration algorithms for non-crossing geometric graphs
inferred← citeshttps://doi.org/10.1145/2462356.2462379openalex-snapshot
Bichromatic compatible matchings
inferred← citeshttps://doi.org/10.1145/2493132.2462379openalex-snapshot
Bichromatic compatible matchings
inferred← citeshttps://doi.org/10.1145/2789149.2789162openalex-snapshot
Computational Geometry Column 61
inferred← citeshttps://doi.org/10.1145/3745756.3809238openalex-snapshot
DeformRF: Data-driven Beamforming and Direction Finding with Deformable Antenna Arrays
inferred← citeshttps://doi.org/10.20382/jocg.v15i1a8openalex-snapshot
Flipping Geometric Triangulations on Hyperbolic Surfaces
inferred← citeshttps://doi.org/10.2139/ssrn.5481168openalex-snapshot
Untangling Segments in the Plane
inferred← citeshttps://doi.org/10.22215/etd/2020-14152openalex-snapshot
Generalized Delaunay Triangulations:Graph-Theoretic Properties and Algorithms
inferred← citeshttps://doi.org/10.23638/dmtcs-22-1-11openalex-snapshot
The Chromatic Number of the Disjointness Graph of the Double Chain
inferred← citeshttps://doi.org/10.2514/1.j061929openalex-snapshot
Unstructured, Pressure-Based Algorithm Using Implicit Runge–Kutta for Moving Boundary Problems
inferred← citeshttps://doi.org/10.2514/6.2022-1051openalex-snapshot
An Unstructured, Pressure-Based Algorithm using Implicit Runge-Kutta for Moving Boundary Problems
inferred← citeshttps://doi.org/10.26565/2304-6201-2020-45-05openalex-snapshot
The mathematical model of the thermal process in Spoke-Type Permanent Magnet Synchronous Machines
inferred← citeshttps://doi.org/10.30819/5232openalex-snapshot
Smartphone-Based 3D Indoor Localization and Navigation
inferred← citeshttps://doi.org/10.3217/wr0km-v1e13openalex-snapshot
Relaxing and lifting triangulations
inferred← citeshttps://doi.org/10.3390/s21206728openalex-snapshot
Magnetoimpedance of CoFeCrSiB Ribbon-Based Sensitive Element with FeNi Covering: Experiment and Modeling
inferred← citeshttps://doi.org/10.3390/s22051987openalex-snapshot
Detection of DIAG and LINE Patterns in PassPoints Graphical Passwords Based on the Maximum Angles of Their Delaunay Triangles
inferred← citeshttps://doi.org/10.37236/557openalex-snapshot
Counting Triangulations of Planar Point Sets
inferred← citeshttps://doi.org/10.4171/022-3/46openalex-snapshot
Geometric bistellar flips: the setting, the context and a construction
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2011.637openalex-snapshot
Bounds on the maximum multiplicity of some common geometric graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.646openalex-snapshot
The Flip Diameter of Rectangulations and Convex Subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5664openalex-snapshot
Bounds on the maximum multiplicity of some common geometric graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.1561openalex-snapshot
Adaptive, Anisotropic and Hierarchical cones of Discrete Convex functions
inferred← citeshttps://doi.org/10.48550/arxiv.1808.03126openalex-snapshot
A Note on the Flip Distance Problem for Edge-Labeled Triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.1905.00791openalex-snapshot
Flip Distance to some Plane Configurations
inferred← citeshttps://doi.org/10.48550/arxiv.2106.08012openalex-snapshot
Strong convexity in flip-graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0601746openalex-snapshot
Geometric bistellar flips. The setting, the context and a construction
inferred← citeshttps://doi.org/10.5555/1109557.1109582openalex-snapshot
Simultaneous diagonal flips in plane triangulations
inferred← citeshttps://doi.org/10.5555/644108.644160openalex-snapshot
Perturbations and vertex removal in a 3D delaunay triangulation
inferred← citeshttps://doi.org/10.5821/dissertation-2117-328194openalex-snapshot
Generalized Delaunay triangulations : graph-theoretic properties and algorithms
inferred← citeshttps://doi.org/10.70675/008c8952z60dcz48b7zb98ez40c1fff00fd9openalex-snapshot
Contribution à la reconstruction de surfaces complexes à partir d'un grand flot de données non organisées pour la métrologie 3D.
inferred← citeshttps://doi.org/10.70675/81cccf81zb873z4003za275zb21b3505db2eopenalex-snapshot
Reconfiguration problems in graphs
inferred← citeshttps://doi.org/10.70675/b9a69b41z56efz40ccz814dza2639f67b149openalex-snapshot
Reconfiguration and combinatorial games
inferred← citeshttps://doi.org/10.7250/itms-2023-0003openalex-snapshot
Building Minimum Spanning Trees under Maximum Edge Length Constraint
inferred← citeshttps://doi.org/10.82308/10590openalex-snapshot
Reconfigurations of polygonal structures
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.