相关论文: New Visualization of Surfaces in Parallel Coordina…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…
In a rectilinear dual of a planar graph vertices are represented by simple rectilinear polygons and edges are represented by side-contact between the corresponding polygons. A rectilinear dual is called a cartogram if the area of each…
Translation surfaces can be defined in an elementary way via polygons, and arise naturally in in the study of various basic dynamical systems. They can also be defined as Abelian differentials on Riemann surfaces, and have moduli spaces…
In (the surface of) a convex polytope P^3 in R^4, an area-minimizing surface avoids the vertices of P and crosses the edges orthogonally. In a smooth Riemannian manifold M with a group of isometries G, an area-minimizing G-invariant…
The authors study smooth lines on projective planes over the algebra C of complex numbers, the algebra C^1 of double numbers, and the algebra C^0 of dual numbers. In the space RP^5, to these smooth lines there correspond families of…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
A translation surface is a surface formed by identifying edges of a collection of polygons in the complex plane that are parallel and of equal length using only translations. We determined that the same circle packing can be realized on…
Multi-sided surfaces are often defined by side interpolants (also called ribbons), i.e. the surface has to connect to the ribbons with a prescribed degree of smoothness. The I-patch is such a family of implicit surfaces capable of…
The Maskit embedding M of a surface \Sigma is the space of geometrically finite groups on the boundary of quasifuchsian space for which the `top' end is homeomorphic to \Sigma, while the `bottom' end consists of two triply punctured…
Implicit Neural Representations (INRs), characterized by neural network-encoded signed distance fields, provide a powerful means to represent complex geometries continuously and efficiently. While successful in computer vision and…
An efficient computer algorithm is described for the perspective drawing of a wide class of surfaces. The class includes surfaces corresponding lo single-valued, continuous functions which are defined over rectangular domains. The algorithm…
This paper presents an additional class of regular polyhedra--envelope polyhedra--made of regular polygons, where the arrangement of polygons (creating a single surface) around each vertex is identical; but dihedral angles between faces…
This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images and the computation of their similarity. The first step in…
It is shown that a superconformal surface with arbitrary codimension in flat Euclidean space has a (necessarily unique) dual superconformal surface if and only if the surface is S-Willmore, the latter a well-known necessary condition to…
Point cloud reconstruction from raw point cloud has been an important topic in computer graphics for decades, especially due to its high demand in modeling and rendering applications. An important way to solve this problem is establishing a…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
In this paper, we introduce and study the Parallel Polyhedral Projection Method (3PM) and the Approximate Parallel Polyhedral Projection Method (A3PM) for finding a point in the intersection of finitely many closed convex sets. Each…
Let $2<n<m\leq \omega$. Let $\CA_n$ denote the class of cylindric algebras of dimension $n$ and $\RCA_n$ denote the class of representable $\CA_n$s. We say that $\A\in \RCA_n$ is representable up to $m$ if $\Cm\At\A$ has an $m$-square…
What is the best representation for doing euclidean geometry on computers? These notes from a SIGGRAPH 2019 short course entitled "Geometric algebra for computer graphics" introduce projective geometric algebra (PGA) as a modern framework…