On the public citation graph

The polytope of all triangulations of a point configuration

0 signed · 47 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/bf02711510openalex-snapshot

Projections of polytopes and the generalized baues conjecture

inferredcites →https://doi.org/10.1016/0012-365x(93)90055-xopenalex-snapshot

Minimum-cardinality triangulations of the d-cube for d=5 and d=6

inferredcites →https://doi.org/10.1016/0166-218x(94)00092-ropenalex-snapshot

Adjacency on combinatorial polyhedra

inferredcites →https://doi.org/10.1090/dimacs/004/35openalex-snapshot

Regular triangulations of convex polytopes

inferredcites →https://doi.org/10.1287/opre.23.1.74openalex-snapshot

On the Set-Covering Problem: II. An Algorithm for Set Partitioning

inferredcites →https://doi.org/10.2307/2006139openalex-snapshot

The Computation of Fixed Points and Applications.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/aama.1997.0571openalex-snapshot

On the Need of Convexity in Patchworking

inferred← citeshttps://doi.org/10.1006/eujc.1999.0319openalex-snapshot

Fiber Polytopes for the Projections between Cyclic Polytopes

inferred← citeshttps://doi.org/10.1006/eujc.1999.0321openalex-snapshot

The Generalized Baues Problem for Cyclic Polytopes I

inferred← citeshttps://doi.org/10.1007/3-540-47738-1_31openalex-snapshot

Nonregular triangulations, view graphs of triangulations, and linear programming duality

inferred← citeshttps://doi.org/10.1007/3-540-49381-6_40openalex-snapshot

Optimality and Integer Programming Formulations of Triangulations in General Dimension

inferred← citeshttps://doi.org/10.1007/978-3-030-52200-1_14openalex-snapshot

Classifying Simplicial Dissections of Convex Polyhedra with Symmetry

inferred← citeshttps://doi.org/10.1007/978-3-662-05148-1_3openalex-snapshot

Computing Triangulations Using Oriented Matroids

inferred← citeshttps://doi.org/10.1007/bfb0045114openalex-snapshot

Enumerating triangulations for products of two simplices and for arbitrary configurations of points

inferred← citeshttps://doi.org/10.1007/pl00009404openalex-snapshot

Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements

inferred← citeshttps://doi.org/10.1007/pl00009405openalex-snapshot

The Number of Geometric Bistellar Neighbors of a Triangulation

inferred← citeshttps://doi.org/10.1007/pl00009416openalex-snapshot

Hilbert Bases, Unimodular Triangulations, and Binary Covers of Rational Polyhedral Cones

inferred← citeshttps://doi.org/10.1007/pl00009439openalex-snapshot

Enumerating Regular Mixed-Cell Configurations

inferred← citeshttps://doi.org/10.1007/pl00009489openalex-snapshot

Triangulations with Very Few Geometric Bistellar Neighbors

inferred← citeshttps://doi.org/10.1007/pl00009506openalex-snapshot

Decomposing the Secondary Cayley Polytope

inferred← citeshttps://doi.org/10.1007/s00200-020-00452-wopenalex-snapshot

Toric varieties and Gröbner bases: the complete $$\mathbb {Q}$$-factorial case

inferred← citeshttps://doi.org/10.1007/s00454-001-0050-yopenalex-snapshot

The Number of Triangulations of the Cyclic Polytope C (n , n -4)

inferred← citeshttps://doi.org/10.1007/s00454-002-2757-9openalex-snapshot

Combinatorics and Quotients of Toric Varieties

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-018-0024-yopenalex-snapshot

Geometry of Log-Concave Density Estimation

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/s004540010013openalex-snapshot

The Graph of Triangulations of a Point Configuration with d +4 Vertices Is 3-Connected

inferred← citeshttps://doi.org/10.1007/s004540010058openalex-snapshot

Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes

inferred← citeshttps://doi.org/10.1007/s100970050003openalex-snapshot

The Cayley Trick, lifting subdivisions and the Bohne–Dress theorem on zonotopal tilings

inferred← citeshttps://doi.org/10.1007/s11854-014-0021-xopenalex-snapshot

On polygonal measures with vanishing harmonic moments

inferred← citeshttps://doi.org/10.1007/s41064-026-00405-xopenalex-snapshot

Geoinformation Perspectives on Recent Developments in Algorithm Engineering and Computational Geometry

inferred← citeshttps://doi.org/10.1016/j.cageo.2021.104920openalex-snapshot

Reconstructing the time-variable sea surface from tide gauge records using optimal data-dependent triangulations

inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.04.004openalex-snapshot

Steiner reducing sets of minimum weight triangulations: Structure and topology

inferred← citeshttps://doi.org/10.1016/j.jcp.2018.04.044openalex-snapshot

An iterative interface reconstruction method for PLIC in general convex grids as part of a Coupled Level Set Volume of Fluid solver

inferred← citeshttps://doi.org/10.1016/j.jcta.2009.03.010openalex-snapshot

Graphs of transportation polytopes

inferred← citeshttps://doi.org/10.1016/j.top.2004.10.007openalex-snapshot

The Gromov norm of the product of two surfaces

inferred← citeshttps://doi.org/10.1016/s0040-9383(00)00030-6openalex-snapshot

The Baues Conjecture in corank 3

inferred← citeshttps://doi.org/10.1016/s0097-3165(03)00117-1openalex-snapshot

The toric Hilbert scheme of a rank two lattice is smooth and irreducible

inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00396-8openalex-snapshot

Assymptotically efficient triangulations of the d-cube∗

inferred← citeshttps://doi.org/10.1023/b:jaco.0000030705.93448.ceopenalex-snapshot

Supernormal Vector Configurations

inferred← citeshttps://doi.org/10.1080/10586458.2018.1459961openalex-snapshot

Area Difference Bounds for Dissections of a Square into an Odd Number of Triangles

inferred← citeshttps://doi.org/10.1090/s0894-0347-00-00330-1openalex-snapshot

A point set whose space of triangulations is disconnected

inferred← citeshttps://doi.org/10.1112/s0025579300012055openalex-snapshot

Triangulations of cyclic polytopes and higher Bruhat orders

inferred← citeshttps://doi.org/10.1137/120887928openalex-snapshot

On a Linear Program for Minimum-Weight Triangulation

inferred← citeshttps://doi.org/10.1142/s0218195902000980openalex-snapshot

ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS

inferred← citeshttps://doi.org/10.2748/tmj/1178224932openalex-snapshot

On the complexity of smooth projective toric varieties

inferred← citeshttps://doi.org/10.47749/t/unicamp.2014.945171openalex-snapshot

Algoritmos exatos para problemas de dilatação mínima em grafos geométricos

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.