相关论文: Implicitizing rational hypersurfaces using approxi…

In this paper, we revisit implicit regularization from the ground up using notions from dynamical systems and invariant subspaces of Morse functions. The key contributions are a new criterion for implicit regularization---a leading…

Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…

Implicit curve and surface reconstruction attracts the attention of many researchers and gains a wide range of applications, due to its ability to describe objects with complicated geometry and topology. However, extra zero-level sets or…

Deep implicit surfaces excel at modeling generic shapes but do not always capture the regularities present in manufactured objects, which is something simple geometric primitives are particularly good at. In this paper, we propose a…

Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…

We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…

Computing occluding contours is a key building block of non-photorealistic rendering, but producing contours with consistent visibility has been notoriously challenging. This paper describes the first general-purpose smooth surface…

Accurate surface geometry representation is crucial in 3D visual computing. Explicit representations, such as polygonal meshes, and implicit representations, like signed distance functions, each have distinct advantages, making efficient…

In characteristic $p>0$ and for $q$ a power of $p$, we compute the number of nonplanar rational curves of arbitrary degrees on a smooth Hermitian surface of degree $q+1$ under the assumption that the curves have a parametrization given by…

In this paper I survey some recent results on finite determination, convergence, and approximation of formal mappings between real submanifolds in complex spaces. A number of conjectures are also given.

A nonstandard application of bivariate polynomial interpolation is discussed: the implicitization of a rational algebraic curve given by its parametric equations. Three different approaches using the same interpolation space are considered,…

Let $X$ be a smooth projective algebraic variety over a number field $k$ and $P$ in $X(k)$. In 2007, the second author conjectured that, in a precise sense, if rational points on $X$ are dense enough, then the best rational approximations…

We present experimental evidence to support the widely held belief that one half of all elliptic curves have infinitely many rational points. The method used to gather this evidence is a refinement of an algorithm due to the author which is…

Given a smooth cubic hypersurface $X$ over a finite field of characteristic greater than 3 and two generic points on $X$, we use a function field analogue of the Hardy-Littlewood circle method to obtain an asymptotic formula for the number…

Recent advances in 3D deep learning have shown that it is possible to train highly effective deep models for 3D shape generation, directly from 2D images. This is particularly interesting since the availability of 3D models is still limited…

Due to their flexibility, frames of Hilbert spaces are attractive alternatives to bases in approximation schemes for problems where identifying a basis is not straightforward or even feasible. Computing a best approximation using frames,…

We present an approach of computing the intersection curve $\mathcal{C}$ of two rational parametric surface $\S_1(u,s)$ and $\S_2(v,t)$, one being projectable and hence can easily be implicitized. Plugging the parametric surface to the…

We study the computational complexity of (deterministic or randomized) algorithms based on point samples for approximating or integrating functions that can be well approximated by neural networks. Such algorithms (most prominently…

We describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

3D Shape representation has substantial effects on 3D shape reconstruction. Primitive-based representations approximate a 3D shape mainly by a set of simple implicit primitives, but the low geometrical complexity of the primitives limits…