Add to ORKGWe introduce a notion of discrete-conformal equivalence of closed convex polyhedra in Euclidean 3-space. Using this notion, we prove a uniformization theorem for closed convex polyhedra in Euclidean 3-space
AbstractWe consider polyhedral approximations of strictly convex compacta in finite-dimensional Eucl...
AbstractWe present a necessary and sufficient condition for the union of a finite number of convex p...
Equivalent formulations for strictly convex, uniformly convex and locally uniformly convex metric li...
Our recent joint work with D. Gu established a discrete version of the uniformization theorem for co...
Abstract. We present a constructive approach for approximating the conformal map (uniformization) of...
Abstract. The rigidity theorems of Alexandrov (1950) and Stoker (1968) are classical results in the ...
A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which gen-era...
We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of d...
We define the notions of strong convexity and strong visibility. These notions generalize standard c...
In this work, we define the nearly uniform convexity and the D-uniform convexity in metric spaces, a...
We investigate various problems related to convexity in the three spaces of constant curvature (the ...
We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of d...
Let Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set of proper...
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved th...
Abstract. One of the basic problems in discrete geometry is to determine the most efficient packing ...
AbstractWe consider polyhedral approximations of strictly convex compacta in finite-dimensional Eucl...
AbstractWe present a necessary and sufficient condition for the union of a finite number of convex p...
Equivalent formulations for strictly convex, uniformly convex and locally uniformly convex metric li...
Our recent joint work with D. Gu established a discrete version of the uniformization theorem for co...
Abstract. We present a constructive approach for approximating the conformal map (uniformization) of...
Abstract. The rigidity theorems of Alexandrov (1950) and Stoker (1968) are classical results in the ...
A discrete conformality for polyhedral metrics on surfaces is introduced in this paper which gen-era...
We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of d...
We define the notions of strong convexity and strong visibility. These notions generalize standard c...
In this work, we define the nearly uniform convexity and the D-uniform convexity in metric spaces, a...
We investigate various problems related to convexity in the three spaces of constant curvature (the ...
We present a new algorithm for conformal mesh parameterization. It is based on a precise notion of d...
Let Γ be a 3-polytopal graph such that every face of Γ is convex. We prove that if the set of proper...
The structure of the set of all convex polyhedra foldable from a square is detailed. It is proved th...
Abstract. One of the basic problems in discrete geometry is to determine the most efficient packing ...
AbstractWe consider polyhedral approximations of strictly convex compacta in finite-dimensional Eucl...
AbstractWe present a necessary and sufficient condition for the union of a finite number of convex p...
Equivalent formulations for strictly convex, uniformly convex and locally uniformly convex metric li...