On the public citation graph

Generalized halfspaces in restricted-orientation convexity

https://doi.org/10.1007/bf01237603
0 signed · 34 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-1-4612-1098-6openalex-snapshot
Computational Geometry
inferredcites →https://doi.org/10.1007/bf01933620openalex-snapshot
On the X-Y convex hull of a set of X-Y polygons
inferredcites →https://doi.org/10.1016/0020-0190(83)90010-8openalex-snapshot
Stabbing c-oriented polygons
inferredcites →https://doi.org/10.1016/0020-0255(84)90025-2openalex-snapshot
On the definition and computation of rectilinear convex hulls
inferredcites →https://doi.org/10.1016/0020-0255(91)90054-xopenalex-snapshot
Restricted-oriented convex sets
inferredcites →https://doi.org/10.1016/0020-0255(96)00056-4openalex-snapshot
Fundamentals of Restricted-Orientation Convexity
inferredcites →https://doi.org/10.1016/0196-6774(81)90023-7openalex-snapshot
A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
inferredcites →https://doi.org/10.1016/0196-6774(84)90027-0openalex-snapshot
Optimal algorithms to compute the closure of a set of iso-rectangles
inferredcites →https://doi.org/10.1016/0890-5401(87)90045-9openalex-snapshot
Optimal computation of finitely oriented convex hulls
inferredcites →https://doi.org/10.1016/b978-0-444-70467-2.50015-1openalex-snapshot
Ortho-Convexity and its Generalizations
inferredcites →https://doi.org/10.1023/a:1004973709260openalex-snapshot
Strong Restricted-Orientation Convexity
inferredcites →https://doi.org/10.1080/00029890.1971.11992815openalex-snapshot
What Is a Convex Set?
inferredcites →https://doi.org/10.1090/procopenalex-snapshot
Proceedings of the American Mathematical Society
inferredcites →https://doi.org/10.1090/s0002-9939-1962-0142058-xopenalex-snapshot
On 𝐿_{𝑛} sets, the Hausdorff metric, and connectedness
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0185510-6openalex-snapshot
Local convexity and 𝐿_{𝑛} sets
inferredcites →https://doi.org/10.1117/12.216441openalex-snapshot
Three-dimensional strong convexity and visibility
inferredcites →https://doi.org/10.1137/0216049openalex-snapshot
On Some Distance Problems in Fixed Orientations
inferredcites →https://doi.org/10.1515/9780773591134-045openalex-snapshot
Thee-Dimensional Restricted-Orientation Convexity¹

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-18849-7openalex-snapshot
Restricted-Orientation Convexity
inferred← citeshttps://doi.org/10.1007/s00022-009-1916-zopenalex-snapshot
On a Conjecture of Fink and Wood
inferred← citeshttps://doi.org/10.1007/s10957-026-03041-yopenalex-snapshot
Blaschke and Separation Theorems for Orthogonal Convex Sets and Some Applications
inferred← citeshttps://doi.org/10.1016/0020-0255(96)00056-4openalex-snapshot
Fundamentals of Restricted-Orientation Convexity
inferred← citeshttps://doi.org/10.1016/j.comgeo.2008.03.003openalex-snapshot
Computing D-convex hulls in the plane
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.04.002openalex-snapshot
Reconstructing orthogonal polyhedra from putative vertex sets
inferred← citeshttps://doi.org/10.1023/a:1004973709260openalex-snapshot
Strong Restricted-Orientation Convexity
inferred← citeshttps://doi.org/10.1051/ps/2020019openalex-snapshot
Set estimation under biconvexity restrictions
inferred← citeshttps://doi.org/10.1088/1751-8113/40/47/f02openalex-snapshot
Statistics of partial minima
inferred← citeshttps://doi.org/10.1109/tiv.2021.3077702openalex-snapshot
Computation of Solution Spaces for Optimization-Based Trajectory Planning
inferred← citeshttps://doi.org/10.1117/12.251784openalex-snapshot
Restricted-orientation half-spaces
inferred← citeshttps://doi.org/10.1142/s0218195903001116openalex-snapshot
PLANAR STRONG VISIBILITY
inferred← citeshttps://doi.org/10.1184/r1/6604322openalex-snapshot
Computational Problems in Strong Visibility
inferred← citeshttps://doi.org/10.1184/r1/6605942openalex-snapshot
Generalizing Halfspaces
inferred← citeshttps://doi.org/10.21236/ada302164openalex-snapshot
Strong Restricted-Orientation Convexity,
inferred← citeshttps://doi.org/10.48550/arxiv.1810.08057openalex-snapshot
Set Estimation Under Biconvexity Restrictions
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.