On the public citation graph

Finding the Medial Axis of a Simple Polygon in Linear Time

0 signed · 160 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/3-540-52055-4openalex-snapshot
Concrete and Abstract Voronoi Diagrams
inferredcites →https://doi.org/10.1007/3-540-54103-9openalex-snapshot
On the Computational Geometry of Pocket Machining
inferredcites →https://doi.org/10.1007/3-540-60313-1_150openalex-snapshot
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
inferredcites →https://doi.org/10.1007/3-540-60313-1_172openalex-snapshot
Fast skeleton construction
inferredcites →https://doi.org/10.1007/bf02187749openalex-snapshot
A linear-time algorithm for computing the voronoi diagram of a convex polygon
inferredcites →https://doi.org/10.1007/bf02187890openalex-snapshot
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
inferredcites →https://doi.org/10.1007/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02574703openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1007/bf02716580openalex-snapshot
A compact piecewise-linear voronoi diagram for convex sites in the plane
inferredcites →https://doi.org/10.1007/bfb0028250openalex-snapshot
On computing the voronoi diagram for restricted planar figures
inferredcites →https://doi.org/10.1016/0146-664x(78)90115-6openalex-snapshot
A review of algorithms for shape analysis
inferredcites →https://doi.org/10.1016/0925-7721(91)90012-4openalex-snapshot
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferredcites →https://doi.org/10.1016/0925-7721(93)90033-3openalex-snapshot
Randomized incremental construction of abstract Voronoi diagrams
inferredcites →https://doi.org/10.1080/00029890.1968.11970990openalex-snapshot
Shape Recognition, Prairie Fires, Convex Deficiencies and Skeletons
inferredcites →https://doi.org/10.1109/fscs.1990.89541openalex-snapshot
Triangulating a simple polygon in linear time
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1109/sfcs.1979.15openalex-snapshot
Efficient computation of continuous skeletons
inferredcites →https://doi.org/10.1109/tac.1974.1100577openalex-snapshot
Pattern classification and scene analysis
inferredcites →https://doi.org/10.1109/tpami.1982.4767267openalex-snapshot
Medial Axis Transformation of a Planar Shape
inferredcites →https://doi.org/10.1117/12.142180openalex-snapshot
Detecting and eliminating false strokes in skeletons by geometric analysis
inferredcites →https://doi.org/10.1137/s0097539795285916openalex-snapshot
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
inferredcites →https://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferredcites →https://doi.org/10.1145/160985.161008openalex-snapshot
A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon
inferredcites →https://doi.org/10.1145/164360.164548openalex-snapshot
Two-dimensional MAT to boundary conversion
inferredcites →https://doi.org/10.1145/28395.28400openalex-snapshot
A Linear time algorithm for computing the Voronoi diagram of a convex polygon
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.22028/d291-26121openalex-snapshot
On the construction of abstract Voronoi diagrams
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/cviu.2000.0835openalex-snapshot
Image Analysis and Computer Vision: 1999
inferred← citeshttps://doi.org/10.1007/3-540-36586-9_16openalex-snapshot
Polygon Decomposition Based on the Straight Line Skeleton
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_26openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_16openalex-snapshot
Packing Two Disks into a Polygonal Environment
inferred← citeshttps://doi.org/10.1007/3-540-44842-x_82openalex-snapshot
An Approximate Morphing between Polylines
inferred← citeshttps://doi.org/10.1007/3-540-45129-3_40openalex-snapshot
Straightening and Partitioning Shapes
inferred← citeshttps://doi.org/10.1007/978-3-030-00256-5_26openalex-snapshot
Convexity-Increasing Morphs of Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-11509-8_16openalex-snapshot
On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-22734-0_8openalex-snapshot
Optimization Heuristics for Computing the Voronoi Skeleton
inferred← citeshttps://doi.org/10.1007/978-3-030-24766-9_36openalex-snapshot
Most Vital Segment Barriers
inferred← citeshttps://doi.org/10.1007/978-3-031-18318-8_24openalex-snapshot
Determination of Largest Possible Cutter Diameter of End Mills for Arbitrarily Shaped 3-Axis Milling Features
inferred← citeshttps://doi.org/10.1007/978-3-031-47511-5openalex-snapshot
Reshaping Convex Polyhedra
inferred← citeshttps://doi.org/10.1007/978-3-031-47511-5_8openalex-snapshot
Tailoring via Flattening
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_12openalex-snapshot
An Almost Optimal Algorithm for Voronoi Diagrams of Non-disjoint Line Segments
inferred← citeshttps://doi.org/10.1007/978-3-319-21404-7_20openalex-snapshot
Largest Empty Square Queries in Rectilinear Polygons
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_71openalex-snapshot
A Straight Skeleton Approximating the Medial Axis
inferred← citeshttps://doi.org/10.1007/978-3-540-68405-3_14openalex-snapshot
The Snowblower Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_33openalex-snapshot
Computational and Structural Advantages of Circular Boundary Representation
inferred← citeshttps://doi.org/10.1007/978-3-540-87395-2_18openalex-snapshot
3D Geo-Network for Agent-based Building Evacuation Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_39openalex-snapshot
A Scheme for Computing Minimum Covers within Simple Regions
inferred← citeshttps://doi.org/10.1007/978-3-642-10649-1_21openalex-snapshot
On the Structure of Straight Skeletons
inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_7openalex-snapshot
Asynchronous Deterministic Rendezvous in Bounded Terrains
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_40openalex-snapshot
Median Trajectories
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_41openalex-snapshot
Optimal Cover of Points by Disks in a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-642-27413-8_1openalex-snapshot
Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_23openalex-snapshot
A Faster Algorithm for Computing Straight Skeletons
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_35openalex-snapshot
Linear-Time Algorithms for the Farthest-Segment Voronoi Diagram and Related Tree Structures
inferred← citeshttps://doi.org/10.1007/bfb0055047openalex-snapshot
Reducing simple polygons to triangles - A proof for an improved conjecture -
inferred← citeshttps://doi.org/10.1007/s00366-012-0256-zopenalex-snapshot
A local adaptation-based generation method of medial axis for efficient engineering analysis
inferred← citeshttps://doi.org/10.1007/s00453-002-0939-8openalex-snapshot
Splitting a Delaunay Triangulation in Linear Time
inferred← citeshttps://doi.org/10.1007/s00453-006-1229-7openalex-snapshot
Motorcycle Graphs and Straight Skeletons
inferred← citeshttps://doi.org/10.1007/s00453-010-9458-1openalex-snapshot
A Scheme for Computing Minimum Covers within Simple Regions
inferred← citeshttps://doi.org/10.1007/s00454-010-9269-9openalex-snapshot
Conformal Mapping in Linear Time
inferred← citeshttps://doi.org/10.1007/s00454-011-9346-8openalex-snapshot
Computing Hereditary Convex Structures
inferred← citeshttps://doi.org/10.1007/s00454-022-00463-zopenalex-snapshot
Deletion in Abstract Voronoi Diagrams in Expected Linear Time and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-025-00768-9openalex-snapshot
The Geodesic Edge Center of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/s10109-020-00325-3openalex-snapshot
An algorithm for maximum inscribed circle based on Voronoi diagrams and geometrical properties
inferred← citeshttps://doi.org/10.1007/s10596-009-9164-8openalex-snapshot
Analytical computation of arc menisci configuration under primary drainage in convex capillary cross sections
inferred← citeshttps://doi.org/10.1007/s10898-013-0129-zopenalex-snapshot
A fully general, exact algorithm for nesting irregular shapes
inferred← citeshttps://doi.org/10.1007/s12518-011-0049-xopenalex-snapshot
Developing a line-of-sight based algorithm for urban street network generalization
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2015.03.004openalex-snapshot
Calculating the medial axis of a CAD model by multi-CPU based parallel computation
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2016.01.006openalex-snapshot
Generation of hierarchical multi-resolution medial axis for CAD models
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126472openalex-snapshot
On the intersection graph of the disks with diameters the sides of a convex n -gon
inferred← citeshttps://doi.org/10.1016/j.cad.2008.08.008openalex-snapshot
Medial axis computation for planar free–form shapes
inferred← citeshttps://doi.org/10.1016/j.cad.2009.05.006openalex-snapshot
Distance functions and skeletal representations of rigid and non-rigid planar shapes
inferred← citeshttps://doi.org/10.1016/j.cad.2014.11.003openalex-snapshot
Constructive generation of the medial axis for solid models
inferred← citeshttps://doi.org/10.1016/j.cam.2026.117372openalex-snapshot
Arc spline approximation of envelopes of evolving planar domains
inferred← citeshttps://doi.org/10.1016/j.comcom.2015.07.022openalex-snapshot
Exploiting skeletonization to restore connectivity in a wireless sensor network
inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.01.004openalex-snapshot
Exact and approximation algorithms for computing optimal fat decompositions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.10.005openalex-snapshot
Approximate convex decomposition of polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2005.11.002openalex-snapshot
Three problems about simple polygons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.11.003openalex-snapshot
Linear reconfiguration of cube-style modular robots
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.12.007openalex-snapshot
Delaunay triangulation of imprecise points in linear time after preprocessing
inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.004openalex-snapshot
Divide-and-conquer for Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.03.003openalex-snapshot
The snowblower problem
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.07.003openalex-snapshot
Reachability by paths of bounded curvature in a convex polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.09.009openalex-snapshot
Localized geometric query problems
inferred← citeshttps://doi.org/10.1016/j.comgeo.2013.06.002openalex-snapshot
Realistic roofs over a rectilinear polygon
inferred← citeshttps://doi.org/10.1016/j.comgeo.2015.11.002openalex-snapshot
An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.002openalex-snapshot
On selecting a fraction of leaves with disjoint neighborhoods in a plane tree
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.04.002openalex-snapshot
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
inferred← citeshttps://doi.org/10.1016/j.gmod.2025.101258openalex-snapshot
Computing medial axis of a simple polygon in linear time based on R-L sequence
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.023openalex-snapshot
Order-k α-hulls and α-shapes
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.003openalex-snapshot
Packing two disks into a polygonal environment
inferred← citeshttps://doi.org/10.1016/j.jmva.2014.04.011openalex-snapshot
On the estimation of the medial axis and inner parallel body
inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00015-8openalex-snapshot
Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.
inferred← citeshttps://doi.org/10.1016/s0925-7721(01)00044-xopenalex-snapshot
Packing two disks in a polygon
inferred← citeshttps://doi.org/10.1016/s0925-7721(98)00025-xopenalex-snapshot
Offset-polygon annulus placement problems
inferred← citeshttps://doi.org/10.1017/9781108592376.015openalex-snapshot
Covering geometric domains
inferred← citeshttps://doi.org/10.1023/b:gein.0000034820.93914.d0openalex-snapshot
A Spatial Access-Oriented Implementation of a 3-D GIS Topological Data Model for Urban Entities
inferred← citeshttps://doi.org/10.1038/nchembio.1477openalex-snapshot
Dissecting motility signaling through activation of specific Src-effector complexes
inferred← citeshttps://doi.org/10.1080/13658816.2010.518317openalex-snapshot
Beyond the epsilon band: polygonal modeling of gradation/uncertainty in area-class maps
inferred← citeshttps://doi.org/10.1083/jcb.201306067openalex-snapshot
CellGeo: A computational platform for the analysis of shape changes in cells with complex geometries
inferred← citeshttps://doi.org/10.1088/1361-6501/ae2147openalex-snapshot
An automated irregularity measurement method for shaped polyester fiber cross-sections based on improved circle detection algorithms
inferred← citeshttps://doi.org/10.1108/rpj-04-2019-0109openalex-snapshot
An improved medial axis path generation algorithm for selective laser melting
inferred← citeshttps://doi.org/10.1109/cadgraphics.2015.33openalex-snapshot
Generation of Hierarchical Multi-resolution Medial Axis for CAD Models
inferred← citeshttps://doi.org/10.1109/cisp.2009.5304494openalex-snapshot
An Internal Direction-Based Algorithm for Medial Axis Transformation of an Arbitrary Polygon
inferred← citeshttps://doi.org/10.1109/geoinformatics.2011.5980668openalex-snapshot
Topology constrain for river dimension-reducing generalization in land-use map
inferred← citeshttps://doi.org/10.1109/icccn49398.2020.9209664openalex-snapshot
Area Charging for Wireless Rechargeable Sensors
inferred← citeshttps://doi.org/10.1109/iccsa.2008.47openalex-snapshot
On the Structure of Straight Skeletons
inferred← citeshttps://doi.org/10.1109/iccsa.2010.34openalex-snapshot
On the Minimization of a Circular Function on the Isomorphic Shrunk Subset
inferred← citeshttps://doi.org/10.1109/icetc.2010.5529241openalex-snapshot
Euclidean distance-ordered thinning for skeleton extraction
inferred← citeshttps://doi.org/10.1109/inmic.2004.1492958openalex-snapshot
Planar orthogonal drawing of complete binary trees inside rectilinear polygons
inferred← citeshttps://doi.org/10.1109/isvd.2009.24openalex-snapshot
Medial Axis Approximation with Bounded Error
inferred← citeshttps://doi.org/10.1109/isvd.2011.9openalex-snapshot
Vroni and ArcVroni: Software for and Applications of Voronoi Diagrams in Science and Engineering
inferred← citeshttps://doi.org/10.1109/lra.2019.2923386openalex-snapshot
Interaction Templates for Multi-Robot Systems
inferred← citeshttps://doi.org/10.1109/sibgrapi.2009.21openalex-snapshot
Fast Medial Axis Transform for Planar Domains With General Boundaries
inferred← citeshttps://doi.org/10.1109/tase.2015.2470096openalex-snapshot
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
inferred← citeshttps://doi.org/10.1109/tvcg.2013.91openalex-snapshot
GosperMap: Using a Gosper Curve for Laying Out Hierarchical Data
inferred← citeshttps://doi.org/10.1109/tvcg.2020.3028953openalex-snapshot
A Simple Pipeline for Coherent Grid Maps
inferred← citeshttps://doi.org/10.1111/j.1467-8659.2004.00006.xopenalex-snapshot
Prototype Modeling from Sketched Silhouettes based on Convolution Surfaces
inferred← citeshttps://doi.org/10.1117/12.532615openalex-snapshot
Fast algorithms of constrained Delaunay triangulation and skeletonization for band images
inferred← citeshttps://doi.org/10.1137/100808459openalex-snapshot
Optimal Cover of Points by Disks in a Simple Polygon
inferred← citeshttps://doi.org/10.1137/s0097539795285916openalex-snapshot
Finding the Constrained Delaunay Triangulation and Constrained Voronoi Diagram of a Simple Polygon in Linear Time
inferred← citeshttps://doi.org/10.1142/s0218195905001658openalex-snapshot
AN APPROXIMATE MORPHING BETWEEN POLYLINES
inferred← citeshttps://doi.org/10.1142/s0218195911003548openalex-snapshot
COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION
inferred← citeshttps://doi.org/10.1145/1016028.1016030openalex-snapshot
Managing uncertainty in moving objects databases
inferred← citeshttps://doi.org/10.1145/1247069.1247079openalex-snapshot
Thick non-crossing paths and minimum-cost flows in polygonal domains
inferred← citeshttps://doi.org/10.1145/1377676.1377727openalex-snapshot
Delaunay triangulations of imprecise pointsin linear time after preprocessing
inferred← citeshttps://doi.org/10.1145/1542362.1542374openalex-snapshot
Computing hereditary convex structures
inferred← citeshttps://doi.org/10.1145/1542362.1542401openalex-snapshot
Divide-and-conquer for Voronoi diagrams revisited
inferred← citeshttps://doi.org/10.1145/1998196.1998233openalex-snapshot
Kinetic convex hulls and delaunay triangulations in the black-box model
inferred← citeshttps://doi.org/10.1145/2533828.2533843openalex-snapshot
2D Arrangement-based Hierarchical Spatial Partitioning
inferred← citeshttps://doi.org/10.1145/2582112.2582171openalex-snapshot
Continuously Flattening Polyhedra Using Straight Skeletons
inferred← citeshttps://doi.org/10.1145/2898961openalex-snapshot
A Faster Algorithm for Computing Straight Skeletons
inferred← citeshttps://doi.org/10.1145/3204456openalex-snapshot
The Medial Axis of a Multi-Layered Environment and Its Application as a Navigation Mesh
inferred← citeshttps://doi.org/10.1145/336154.336211openalex-snapshot
Reachability by paths of bounded curvature in convex polygons
inferred← citeshttps://doi.org/10.1145/777792.777802openalex-snapshot
Polygon decomposition based on the straight line skeleton
inferred← citeshttps://doi.org/10.1145/777801.777802openalex-snapshot
Polygon decomposition based on the straight line skeleton
inferred← citeshttps://doi.org/10.1145/997817.997823openalex-snapshot
Approximate convex decomposition of polygons
inferred← citeshttps://doi.org/10.1145/997817.997825openalex-snapshot
Computing the visibility graph of points within a polygon
inferred← citeshttps://doi.org/10.1177/14780771241254636openalex-snapshot
Spatial circulatory networks based on the peripheral medial axis transform
inferred← citeshttps://doi.org/10.1515/geocart-2017-0004openalex-snapshot
Area collapse algorithm computing new curve of 2D geometric objects
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.1134openalex-snapshot
Artist Agent: A Reinforcement Learning Approach to Automatic Stroke Generation in Oriental Ink Painting
inferred← citeshttps://doi.org/10.20382/jocg.v7i2a3openalex-snapshot
Shortest path in a polygon using sublinear space
inferred← citeshttps://doi.org/10.22215/etd/2014-10404openalex-snapshot
Obstacle-Avoiding Path Existence Queries in a Simple Polygon
inferred← citeshttps://doi.org/10.3138/carto.43.4.257openalex-snapshot
Length-Preserving Thinning Algorithm for Line Extraction from Landcover Data
inferred← citeshttps://doi.org/10.3390/a16060281openalex-snapshot
Folding Every Point on a Polygon Boundary to a Point
inferred← citeshttps://doi.org/10.4043/29722-msopenalex-snapshot
Evaluation of Karst Porosity Morphological Properties through Borehole Image Logs – Correlation with Dynamic Reservoir Properties from a presalt Oil Field
inferred← citeshttps://doi.org/10.4171/rmi/673openalex-snapshot
Tree-like decompositions of simply connected domains
inferred← citeshttps://doi.org/10.47839/ijc.19.4.1987openalex-snapshot
AN OPTIMIZED ALGORITHM FOR COMPUTING THE VORONOI SKELETON
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0558openalex-snapshot
Querying for the Largest Empty Geometric Object in a Desired Location
inferred← citeshttps://doi.org/10.48550/arxiv.1008.4244openalex-snapshot
Reachability by Paths of Bounded Curvature in a Convex Polygon
inferred← citeshttps://doi.org/10.48550/arxiv.1111.2918openalex-snapshot
Localized Geometric Query Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1407.0614openalex-snapshot
Covering the Boundary of a Simple Polygon with Geodesic Unit Disks
inferred← citeshttps://doi.org/10.48550/arxiv.1411.2816openalex-snapshot
An Expected Linear-Time Algorithm for the Farthest-Segment Voronoi Diagram
inferred← citeshttps://doi.org/10.48550/arxiv.1805.10847openalex-snapshot
On the intersection graph of the disks with diameters the sides of a convex $n$-gon
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9811019openalex-snapshot
Locked and Unlocked Polygonal Chains in 3D
inferred← citeshttps://doi.org/10.5555/1109557.1109610openalex-snapshot
Finding large sticks and potatoes in polygons
inferred← citeshttps://doi.org/10.5555/545381.545401openalex-snapshot
Motorcycle graphs and straight skeletons
inferred← citeshttps://doi.org/10.70675/8c94fe48zc506z4c72zb5aez7f228be25701openalex-snapshot
Visualisation d'information : de la théorie sémiotique à des exemples pratiques basés sur la représentation de graphes et d'hypergraphes
inferred← citeshttps://doi.org/10.7153/mia-2023-26-21openalex-snapshot
Optimal divisions of a convex body
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.