Related papers: Elimination Without Eliminating: Computing Complem…
We present a Julia package HypersurfaceRegions.jl for computing all connected components in the complement of an arrangement of real algebraic hypersurfaces in $\mathbb{R}^n$.
Existing scene understanding systems mainly focus on recognizing the visible parts of a scene, ignoring the intact appearance of physical objects in the real-world. Concurrently, image completion has aimed to create plausible appearance for…
We study how the supporting hyperplanes produced by the projection process can complement the method of alternating projections and its variants for the convex set intersection problem. For the problem of finding the closest point in the…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
Let $V$ be a degree $d$, reduced hypersurface in $\mathbb{CP}^{n+1}$, $n \geq 1$, and fix a generic hyperplane, $H$. Denote by $\mathcal{U}$ the (affine) hypersurface complement, $\mathbb{CP}^{n+1}- V \cup H$, and let $\mathcal{U}^c$ be the…
Based on the computation of a superset of the implicit support, implicitization of a parametrically given hyper-surface is reduced to computing the nullspace of a numeric matrix. Our approach exploits the sparseness of the given parametric…
Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…
Autonomous navigation in unstructured off-road environments is greatly improved by semantic scene understanding. Conventional image processing algorithms are difficult to implement and lack robustness due to a lack of structure and high…
Region extraction is a very common task in both Computer Science and Engineering with several applications in object recognition and motion analysis, among others. Most of the literature focuses on regions delimited by straight lines, often…
We enumerate complex algebraic hypersurfaces in $P^n$, of a given (high) degree with one singular point of a given singularity type. Our approach is to compute the (co)homology classes of the corresponding equi-singular strata in the…
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…
We propose a space-efficient algorithm for hidden surface removal that combines one of the fastest previous algorithms for that problem with techniques based on bit manipulation. Such techniques had been successfully used in other settings,…
In the paper we provide a new method of proving the existence of a hypersurface of degree $d$ in $\mathbb{P}^n$, with a general point of multiplicity $m$ and vanishing at a given set of points $Z$, by looking at weak combinatorics of a set…
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
We propose a covariant scheme for measuring entanglement on general hypersurfaces in relativistic quantum field theory. For that, we introduce an auxiliary relativistic field, 'the discretizer', that by locally interacting with the field…
The lack of proper class discrimination among the Hyperspectral (HS) data points poses a potential challenge in HS classification. To address this issue, this paper proposes an optimal geometry-aware transformation for enhancing the…
Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we…
The paper is focused on the four-dimensional visualization of hypersurfaces represented by implicit equations without their parametrization. We describe a general method to find shadow boundaries in an arbitrary dimension and apply it in a…
We provide a new approach for computing integrals over hypersurfaces in the level set framework. The method is based on the discretization (via simple Riemann sums) of the classical formulation used in the level set framework, with the…
We present a method for estimating detailed scene illumination using human faces in a single image. In contrast to previous works that estimate lighting in terms of low-order basis functions or distant point lights, our technique estimates…