On the public citation graph

Algorithms for computing the center of area of a convex polygon

0 signed · 22 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-51542-9_15openalex-snapshot
Computing the center of area of a polygon
inferredcites →https://doi.org/10.1007/978-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf02187692openalex-snapshot
A polynomial solution for the potato-peeling problem
inferredcites →https://doi.org/10.1016/s0747-7171(08)80070-3openalex-snapshot
On the two-dimensional davenport-schinzel problem
inferredcites →https://doi.org/10.1080/00029890.1962.11989843openalex-snapshot
Forbidden Area
inferredcites →https://doi.org/10.1090/cbms/010openalex-snapshot
Arrangements and Spreads
inferredcites →https://doi.org/10.1109/sfcs.1987.44openalex-snapshot
On the lower envelope of bivariate functions and its applications
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
inferredcites →https://doi.org/10.1137/0216005openalex-snapshot
On k -Hulls and Related Problems
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
inferredcites →https://doi.org/10.2307/2315618openalex-snapshot
Forbidden Regions are Convex

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36494-3_6openalex-snapshot
Optimization in Arrangements
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_15openalex-snapshot
Computing the center of area of a polygon
inferred← citeshttps://doi.org/10.1007/978-4-431-68093-2_3openalex-snapshot
Computational Geometry: Recent Developments
inferred← citeshttps://doi.org/10.1016/0167-8655(93)90137-3openalex-snapshot
Editorial
inferred← citeshttps://doi.org/10.1016/j.iot.2023.100745openalex-snapshot
Fairness-aware data offloading of IoT applications enabled by heterogeneous UAVs
inferred← citeshttps://doi.org/10.1080/00207160801965180openalex-snapshot
An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
inferred← citeshttps://doi.org/10.1142/s021819590300127xopenalex-snapshot
COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
inferred← citeshttps://doi.org/10.1142/s0218195904001469openalex-snapshot
GOOD NEWS: PARTITIONING A SIMPLE POLYGON BY COMPASS DIRECTIONS
inferred← citeshttps://doi.org/10.1145/58395.58397openalex-snapshot
Computational geometry column
inferred← citeshttps://doi.org/10.1145/777792.777804openalex-snapshot
Good NEWS
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.