This thesis consists of two parts: digital geometry and discrete optimization. In the first part we study the structure of digital straight line segments. We also study digital curves from a combinatorial point of view. In Paper I we study the straightness in the 8-connected plane and in the Khalimsky plane by considering vertical distances and unions of two segments. We show that we can investigate the straightness of Khalimsky arcs by using our knowledge from the 8-connected plane. In Paper II we determine the number of Khalimsky-continuous functions with 2, 3 and 4 points in their codomain. These enumerations yield examples of known sequences as well as new ones. We also study the asymptotic behavior of each of them. In Paper III we stud...
We exhibit the structure of digital straight line segments in the 8-connected plane and in the Khali...
AbstractThe discrete version of Green's Theorem and bivariate difference calculus provide a general ...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
This thesis consists of two parts: digital geometry and discrete optimization. In the first part we ...
International audienceThe notion of convexity translates non-trivially from Euclidean geometry to di...
International audienceIn this paper, we arithmetically describe the convex hull ofa digital straight...
We describe a common extension of the fundamental theorem of Linear Programming on the existence of ...
International audienceWe present a method for fitting a digital line/plane from a given set of 2D/3D...
We consider the digital plane of integer points equipped with the Khalimsky topology. We suggest a d...
International audienceIn recent years, the theory behind distance functions defined by neighbourhood...
Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a...
© 2018 Dr. David Paul Jerome KirszenblatThis thesis addresses four problems in continuous and discre...
International audienceThe paper studies local convexity properties of parts of dig- ital boundaries....
We consider the following problem. Consider the family Γn of all 8-connected digital curves γn of n ...
We consider the digital plane of integer points equipped with the Khalimsky topology. We suggest a d...
We exhibit the structure of digital straight line segments in the 8-connected plane and in the Khali...
AbstractThe discrete version of Green's Theorem and bivariate difference calculus provide a general ...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
This thesis consists of two parts: digital geometry and discrete optimization. In the first part we ...
International audienceThe notion of convexity translates non-trivially from Euclidean geometry to di...
International audienceIn this paper, we arithmetically describe the convex hull ofa digital straight...
We describe a common extension of the fundamental theorem of Linear Programming on the existence of ...
International audienceWe present a method for fitting a digital line/plane from a given set of 2D/3D...
We consider the digital plane of integer points equipped with the Khalimsky topology. We suggest a d...
International audienceIn recent years, the theory behind distance functions defined by neighbourhood...
Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a...
© 2018 Dr. David Paul Jerome KirszenblatThis thesis addresses four problems in continuous and discre...
International audienceThe paper studies local convexity properties of parts of dig- ital boundaries....
We consider the following problem. Consider the family Γn of all 8-connected digital curves γn of n ...
We consider the digital plane of integer points equipped with the Khalimsky topology. We suggest a d...
We exhibit the structure of digital straight line segments in the 8-connected plane and in the Khali...
AbstractThe discrete version of Green's Theorem and bivariate difference calculus provide a general ...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...