On the public citation graph
Searching for empty convex polygons
0 signed · 48 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0022-0000(89)90038-xopenalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1090/pspum/034/525325openalex-snapshot
Combinatorial problems in geometry and number theory
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/321906.321910openalex-snapshot
On Finding the Maxima of a Set of Vectors
inferredcites →https://doi.org/10.1145/323233.323255openalex-snapshot
Computing the largest empty convex subset of a set of points
inferredcites →https://doi.org/10.1145/41958.41960openalex-snapshot
Finding the visibility graph of a simple polygon in time proportional to its size
inferredcites →https://doi.org/10.4153/cmb-1983-077-8openalex-snapshot
Sets with No Empty Convex 7-Gons
inferredcites →https://doi.org/10.4153/cmb-1987-064-1openalex-snapshot
Empty Simplices in Euclidean Space
inferredcites →https://doi.org/10.5169/seals-32945openalex-snapshot
Konvexe Fünfecke in ebenen Punktmengen
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11573036_14openalex-snapshot
How to Place Efficiently Guards and Paintings in an Art Gallery
inferred← citeshttps://doi.org/10.1007/3-540-44634-6_18openalex-snapshot
On the Reflexivity of Point Sets
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_28openalex-snapshot
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_16openalex-snapshot
Maximum Clique and Minimum Clique Partition in Visibility Graphs
inferred← citeshttps://doi.org/10.1007/3-540-47738-1_7openalex-snapshot
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-31596-6_9openalex-snapshot
Dark Silicon Patterning: Efficient Power Utilization Through Run-Time Mapping
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_46openalex-snapshot
On the Computational Complexity of Erdős-Szekeres and Related Problems in ℝ3
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_6openalex-snapshot
On the Reflexivity of Point Sets
inferred← citeshttps://doi.org/10.1007/978-981-95-0215-8_19openalex-snapshot
Erdős-Szekeres Maker-Breaker Games
inferred← citeshttps://doi.org/10.1007/s00373-010-0957-2openalex-snapshot
Every Large Point Set contains Many Collinear Points or an Empty Pentagon
inferred← citeshttps://doi.org/10.1007/s00453-022-01002-1openalex-snapshot
Empty Squares in Arbitrary Orientation Among Points
inferred← citeshttps://doi.org/10.1007/s00454-002-2829-xopenalex-snapshot
Finding Sets of Points without Empty Convex 6-Gons
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101742openalex-snapshot
Largest and smallest area triangles on imprecise points
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.03.009openalex-snapshot
A combinatorial property on angular orders of plane point sets
inferred← citeshttps://doi.org/10.1016/j.ipl.2021.106221openalex-snapshot
Faster counting empty convex polygons in a planar point set
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00048-8openalex-snapshot
Robust algorithms for restricted domains
inferred← citeshttps://doi.org/10.1090/s0273-0979-00-00877-6openalex-snapshot
The Erdos-Szekeres problem on points in convex position – a survey
inferred← citeshttps://doi.org/10.1109/iccd.2015.7357167openalex-snapshot
Dark silicon aware runtime mapping for many-core systems: A patterning approach
inferred← citeshttps://doi.org/10.1109/robio.2010.5723430openalex-snapshot
Data association using empty convex polygonal regions in EKF-SLAM
inferred← citeshttps://doi.org/10.1137/1.9781611973099.65openalex-snapshot
On a Linear Program for Minimum-Weight Triangulation: Extended Abstract
inferred← citeshttps://doi.org/10.1137/120887928openalex-snapshot
On a Linear Program for Minimum-Weight Triangulation
inferred← citeshttps://doi.org/10.1137/s0097539702405139openalex-snapshot
An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee
inferred← citeshttps://doi.org/10.1145/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.1145/378583.378707openalex-snapshot
Efficient and small representation of line arrangements with applications
inferred← citeshttps://doi.org/10.1587/transfun.2020dmp0002openalex-snapshot
Counting Convex and Non-Convex 4-Holes in a Point Set
inferred← citeshttps://doi.org/10.1587/transfun.2022dmp0007openalex-snapshot
Enumerating Empty and Surrounding Polygons
inferred← citeshttps://doi.org/10.17169/refubium-7379openalex-snapshot
Computational aspects of some problems from discrete geometry in higher dimensions
inferred← citeshttps://doi.org/10.3390/sym14010078openalex-snapshot
Counting Non-Convex 5-Holes in a Planar Point Set
inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.20openalex-snapshot
An Integer Programming Formulation Using Convex Polygons for the Convex Partition Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1012.5187openalex-snapshot
Unsolved Problems in Visibility Graphs of Points, Segments and Polygons
inferred← citeshttps://doi.org/10.48550/arxiv.1102.1235openalex-snapshot
On joint triangulations of two sets of points in the plane
inferred← citeshttps://doi.org/10.48550/arxiv.1111.5979openalex-snapshot
Erdős-Szekeres and Testing Weak epsilon-Nets are NP-hard in 3 dimensions - and what now?
inferred← citeshttps://doi.org/10.48550/arxiv.1304.0247openalex-snapshot
Finding a largest empty convex subset in space is W[1]-hard
inferred← citeshttps://doi.org/10.5555/2095116.2095181openalex-snapshot
On a linear program for minimum-weight triangulation
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.