The following pages link to Reneta P. Barneva (Q499708):
Displaying 23 items.
- Combinatorial and discrete geometric problems in image analysis (Q499709) (← links)
- Connectivity of discrete planes (Q596053) (← links)
- On the polyhedral complexity of the integer points in a hyperball (Q952452) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Thin discrete triangular meshes (Q1583599) (← links)
- Graceful planes and lines. (Q1603644) (← links)
- Plane digitization and related combinatorial problems (Q1775618) (← links)
- (Q2569820) (redirect page) (← links)
- Gradient elements of the knapsack polytope (Q2569821) (← links)
- Digital Stars and Visibility of Digital Objects (Q3069605) (← links)
- Exact Image Reconstruction from a Single Projection through Real Computation (Q3439189) (← links)
- Minimal Offsets That Guarantee Maximal or Minimal Connectivity of Digital Curves in nD (Q3648796) (← links)
- Theoretical Issues of Cluster Pattern Interfaces (Q3651623) (← links)
- (Q4263844) (← links)
- (Q4471796) (← links)
- Object discretizations in higher dimensions (Q4538846) (← links)
- “Honeycomb” vs Square and Cubic Models (Q4917109) (← links)
- (Q5273292) (← links)
- GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION (Q5305546) (← links)
- Combinatorial Relations for Digital Pictures (Q5386020) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710809) (← links)
- Discrete Geometry for Computer Imagery (Q5902430) (← links)
- Properties of a firm’s factor demands, optimal production correspondence, and an economy‘s aggregated supply/demand (Q6150269) (← links)
