On the public citation graph

Generating Rooted Triangulations Without Repetitions

https://doi.org/10.1007/bf01944353

0 signed · 54 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.1006/jctb.1996.0008openalex-snapshot

Polyhedra of Small Order and Their Hamiltonian Properties

inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/bf02293050openalex-snapshot

A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

inferredcites →https://doi.org/10.1016/0166-218x(95)00026-nopenalex-snapshot

Reverse search for enumeration

inferredcites →https://doi.org/10.1016/0304-3975(78)90051-8openalex-snapshot

Finding the intersection of two convex polyhedra

inferredcites →https://doi.org/10.1016/0925-7721(95)00034-8openalex-snapshot

Guarding polyhedral terrains

inferredcites →https://doi.org/10.1090/s0025-5718-1967-0223277-3openalex-snapshot

Generations of triangulations of the sphere

inferredcites →https://doi.org/10.1112/plms/s3-14.4.746openalex-snapshot

Enumeration of Triangulations of the Disk

inferredcites →https://doi.org/10.1145/109648.109659openalex-snapshot

A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

inferredcites →https://doi.org/10.4153/cjm-1962-002-9openalex-snapshot

A Census of Planar 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/scj.10563openalex-snapshot

Listing all rectangular drawings with certain properties

inferred← citeshttps://doi.org/10.1006/jagm.1997.0898openalex-snapshot

Isomorph-Free Exhaustive Generation

inferred← citeshttps://doi.org/10.1006/jcta.1998.2953openalex-snapshot

Inner Diagonals of Convex Polytopes

inferred← citeshttps://doi.org/10.1007/3-540-44679-6_15openalex-snapshot

Efficient Generation of Triconnected Plane Triangulations

inferred← citeshttps://doi.org/10.1007/3-540-45678-3_10openalex-snapshot

Enumerating Floorplans with n Rooms

inferred← citeshttps://doi.org/10.1007/3-540-48224-5_36openalex-snapshot

Efficient Generation of Plane Triangulations without Repetitions

inferred← citeshttps://doi.org/10.1007/978-3-030-59267-7_5openalex-snapshot

Floorplans with Walls

inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_21openalex-snapshot

Escape from the Room

inferred← citeshttps://doi.org/10.1007/978-3-319-03841-4_28openalex-snapshot

Drawing Planar Graphs with a Prescribed Inner Face

inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_6openalex-snapshot

Fitting Planar Graphs on Planar Maps

inferred← citeshttps://doi.org/10.1007/978-3-319-71150-8_3openalex-snapshot

Floorplans with Columns

inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_25openalex-snapshot

More Efficient Generation of Plane Triangulations

inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_41openalex-snapshot

Untangling a Planar Graph

inferred← citeshttps://doi.org/10.1007/978-981-96-1093-8_26openalex-snapshot

Enumerating Floorplans with Any Set of Columns

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

Transformations for maximal planar graphs with minimum degree five

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

Flipping Edges in Triangulations

inferred← citeshttps://doi.org/10.1007/s00373-005-0615-2openalex-snapshot

Graphs of Triangulations and Perfect Matchings

inferred← citeshttps://doi.org/10.1007/s00453-015-0018-6openalex-snapshot

Extending Convex Partial Drawings of Graphs

inferred← citeshttps://doi.org/10.1007/s00454-008-9130-6openalex-snapshot

Untangling a Planar Graph

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

Efficient generation of triconnected plane triangulations

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

Flips in planar graphs

inferred← citeshttps://doi.org/10.1016/j.dam.2023.08.018openalex-snapshot

Enumerating floorplans with walls

inferred← citeshttps://doi.org/10.1016/j.ipl.2007.05.009openalex-snapshot

On planar path transformation

inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.005openalex-snapshot

Planar tree transformation: Results and counterexample

inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00240-5openalex-snapshot

Efficient generation of plane trees

inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00117-9openalex-snapshot

Memory-efficient enumeration of constrained spanning trees

inferred← citeshttps://doi.org/10.1109/icict.2007.375332openalex-snapshot

Planar Tree Transformation through Flips

inferred← citeshttps://doi.org/10.1109/mdm58254.2023.00029openalex-snapshot

DDCEL: Efficient Distributed Doubly Connected Edge List for Large Spatial Networks

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

Family Trees for Enumeration

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.1145/237218.237367openalex-snapshot

Flipping edges in triangulations

inferred← citeshttps://doi.org/10.1515/9780773591134-012openalex-snapshot

Generating Rooted Triangulations with Minimum Degree Four

inferred← citeshttps://doi.org/10.1587/transfun.2022dmp0007openalex-snapshot

Enumerating Empty and Surrounding Polygons

inferred← citeshttps://doi.org/10.1587/transfun.e101.a.1392openalex-snapshot

Enumerating Floorplans with Columns

inferred← citeshttps://doi.org/10.1587/transinf.2024fcp0001openalex-snapshot

Enumerating Floorplans with Aligned Columns

inferred← citeshttps://doi.org/10.1587/transinf.2024fcp0002openalex-snapshot

Escape from the Room

inferred← citeshttps://doi.org/10.3990/1.9789036520805openalex-snapshot

Triangulations and their application in surface reconstruction

inferred← citeshttps://doi.org/10.4036/iis.2002.199openalex-snapshot

Enumerating Floorplans with Some Properties

inferred← citeshttps://doi.org/10.48550/arxiv.1210.6905openalex-snapshot

Theory on Structure and Coloring of Maximal Planar Graphs (I): Relationship between Structure and Coloring

inferred← citeshttps://doi.org/10.48550/arxiv.1212.0804openalex-snapshot

How many vertex locations can be arbitrarily chosen when drawing planar graphs?

inferred← citeshttps://doi.org/10.48550/arxiv.1308.3370openalex-snapshot

Drawing Planar Graphs with a Prescribed Inner Face

inferred← citeshttps://doi.org/10.48550/arxiv.1605.05102openalex-snapshot

Enumeration of Enumeration Algorithms

inferred← citeshttps://doi.org/10.7155/jgaa.00234openalex-snapshot

Generating All Triangulations of Plane Graphs

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.