On the public citation graph

The Middle-Cut Triangulations of the n -Cube

0 signed · 39 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/978-3-642-50327-6openalex-snapshot
The Computation of Fixed Points and Applications
inferredcites →https://doi.org/10.1016/0012-365x(82)90185-6openalex-snapshot
Minimal triangulation of the 4-cube
inferredcites →https://doi.org/10.1016/0012-365x(82)90190-xopenalex-snapshot
A triangulation of the n-cube
inferredcites →https://doi.org/10.1016/0097-3165(76)90014-5openalex-snapshot
Triangulations for the cube
inferredcites →https://doi.org/10.1016/0166-218x(82)90041-5openalex-snapshot
A note on minimal triangulations of an n-cube
inferredcites →https://doi.org/10.1016/0377-2217(81)90190-9openalex-snapshot
Simplicial fixed point algorithms
inferredcites →https://doi.org/10.1038/125266a0openalex-snapshot
An Introduction to the Geometry of N Dimensions
inferredcites →https://doi.org/10.1093/oso/9780198596974.003.0005openalex-snapshot
Piecewise linear topology
inferredcites →https://doi.org/10.1111/j.1467-9574.1981.tb00713.xopenalex-snapshot
Variable dimension fixed point algorithms and triangulations
inferredcites →https://doi.org/10.1111/j.1749-6632.1985.tb14555.xopenalex-snapshot
TRIANGULATING THE d ‐CUBE
inferredcites →https://doi.org/10.1137/0115116openalex-snapshot
The Approximation of Fixed Points of a Continuous Mapping

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119882329.ch5openalex-snapshot
Data‐Driven Methods for Fault Diagnosis
inferred← citeshttps://doi.org/10.1002/fld.4076openalex-snapshot
From level set to volume of fluid and back again at second‐order accuracy
inferred← citeshttps://doi.org/10.1006/eujc.1999.0327openalex-snapshot
A Lower Bound for the Simplexity of then-Cube via Hyperbolic Volumes
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5514openalex-snapshot
A Better Triangulation for Wright's 2n-Ray Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_79openalex-snapshot
Simplicial Methods for Approximating Fixed Point with Applications in Combinatorial Optimizations
inferred← citeshttps://doi.org/10.1007/978-1-4612-0963-8_4openalex-snapshot
Tiling and Dissection
inferred← citeshttps://doi.org/10.1007/bf01581250openalex-snapshot
TheD 2-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations
inferred← citeshttps://doi.org/10.1007/bf02434927openalex-snapshot
Generalized Sperner lemma and subdivisions into simplices of equal volume
inferred← citeshttps://doi.org/10.1007/bf02574690openalex-snapshot
A simple and relatively efficient triangulation of then-cube
inferred← citeshttps://doi.org/10.1007/s00371-011-0624-5openalex-snapshot
Fluid simulation with adaptively sharpening and embedded boundary conditions
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90102-xopenalex-snapshot
A note on triangulating the 5-cube
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90055-xopenalex-snapshot
Minimum-cardinality triangulations of the d-cube for d=5 and d=6
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90339-uopenalex-snapshot
A triangulation of the 6-cube with 308 simplices
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00075-8openalex-snapshot
Simplexity of the cube
inferred← citeshttps://doi.org/10.1016/j.amc.2015.07.016openalex-snapshot
On 0/1-polytopes with nonobtuse triangulations
inferred← citeshttps://doi.org/10.1016/j.ins.2014.12.014openalex-snapshot
Probability density function estimation with the frequency polygon transform
inferred← citeshttps://doi.org/10.1016/j.jcp.2007.05.032openalex-snapshot
Geometric integration over irregular domains with application to level-set methods
inferred← citeshttps://doi.org/10.1016/j.jcp.2008.07.021openalex-snapshot
Robust second-order accurate discretizations of the multi-dimensional Heaviside and Dirac delta functions
inferred← citeshttps://doi.org/10.1016/j.jcp.2023.112480openalex-snapshot
JAX-DIPS: Neural bootstrapping of finite discretization methods and application to elliptic problems with discontinuities
inferred← citeshttps://doi.org/10.1017/9781009701259.011openalex-snapshot
On the Size of Higher-Dimensional Triangulations
inferred← citeshttps://doi.org/10.1080/0020717021000031484openalex-snapshot
Identification of piecewise affine models in noisy environment
inferred← citeshttps://doi.org/10.1088/0264-9381/26/14/145007openalex-snapshot
Solving the Einstein constraint equations on multi-block triangulations using finite element methods
inferred← citeshttps://doi.org/10.1090/s0273-0979-05-01050-5openalex-snapshot
What is known about unit cubes
inferred← citeshttps://doi.org/10.1109/12.707591openalex-snapshot
A geometric approach to maximum-speed n-dimensional continuous linear interpolation in rectangular grids
inferred← citeshttps://doi.org/10.1137/0406013openalex-snapshot
A New Triangulation for Simplicial Algorithms
inferred← citeshttps://doi.org/10.1137/0803040openalex-snapshot
The $D_2^* $-Triangulation for Continuous Deformation Algorithms to Compute Solutions of Nonlinear Equations
inferred← citeshttps://doi.org/10.1137/17m1126370openalex-snapshot
A Consistent Analytical Formulation for Volume Estimation of Geometries Enclosed by Implicitly Defined Surfaces
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.3666openalex-snapshot
Non-axisymmetric instabilities in self-gravitating tori around black holes, and solving Einstein constraints with superconvergent finite element methods
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.