English
Related papers

Related papers: Testing tensor product B\'{e}zier surfaces for coi…

200 papers

This is a review article on the Bennequin-Birman-Menasco machinery for studying embedded incompressible surfaces in 3-space via their `braid foliations'. Two cases are investigated: case (1) The surface has non-empty boundary; the boundary…

Geometric Topology · Mathematics 2007-05-23 Joan S. Birman , Elizabeth Finkelstein

We prove a symmetric version of B\'ezout's theorem. More precisely, we show that the symmetric orbit type of a transverse intersection of complex symmetric hypersurfaces in projective space is determined by the degrees. In the projective…

Algebraic Geometry · Mathematics 2024-10-01 Samuel Lidz , Zachary Lihn , Adam Melrod

We give an algorithm for completing an order-$m$ symmetric low-rank tensor from its multilinear entries in time roughly proportional to the number of tensor entries. We apply our tensor completion algorithm to the problem of learning…

Data Structures and Algorithms · Computer Science 2015-11-25 Tselil Schramm , Benjamin Weitz

Iterative methods based on tensors have emerged as powerful tools for solving tensor equations, and have significantly advanced across multiple disciplines. In this study, we propose two-step tensor-based iterative methods to solve the…

Numerical Analysis · Mathematics 2025-02-07 Ratikanta Behera , Saroja Kumar Panda , Jajati Keshari Sahoo

We study projective surfaces in $\mathbb{P}^3$ which can be written as Hadamard product of two curves. We show that quadratic surfaces which are Hadamard product of two lines are smooth and tangent to all coordinate planes, and such…

Algebraic Geometry · Mathematics 2026-03-30 Dario Antolini , Edoardo Ballico , Alessandro Oneto

In this paper, we use the blending functions of Lupa\c{s} type (rational) $(p,q)$-Bernstein operators based on $(p,q)$-integers for construction of Lupa\c{s} $(p,q)$-B$\acute{e}$zier curves (rational curves) and surfaces (rational surfaces)…

Graphics · Computer Science 2016-06-14 Khalid Khan , D. K. Lobiyal

We derive the implicit equations for certain parametric surfaces in three-dimensional projective space termed tensor product surfaces. Our method computes the implicit equation for such a surface based on the knowledge of the syzygies of…

Commutative Algebra · Mathematics 2019-08-07 Eliana Duarte , Alexandra Seceleanu

Smooth joins of simplex Bernstein-B\'ezier polynomials have been studied extensively in the past. In this paper a new method is proposed to define continuity conditions for tensor-product Bernstein polynomials on a class of mixed grids that…

Numerical Analysis · Mathematics 2016-02-04 Tim Visser , Cornelis C. de Visser , Erik-Jan van Kampen

We define a general product of two $n$-dimensional tensors $\mathbb {A}$ and $\mathbb {B}$ with orders $m\ge 2$ and $k\ge 1$, respectively. This product is a generalization of the usual matrix product, and satisfies the associative law.…

Combinatorics · Mathematics 2012-12-10 Jia-Yu Shao

Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness…

Graphics · Computer Science 2025-10-30 Anchang Bao , Enya Shen , Jianmin Wang

We present efficient algorithms for detecting central and mirror symmetry for the case of algebraic curves defined by means of polynomial parametrizations. The algorithms are based on the existence of a linear relationship between two…

Algebraic Geometry · Mathematics 2012-12-27 Juan G. Alcazar

In this work, we develop a framework based on piecewize B\'ezier curves to plane shapes deformation and we apply it to shape optimization problems. We describe a general setting and some general result to reduce the study of a shape…

Optimization and Control · Mathematics 2013-02-19 Olivier Ruatta

Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…

Methodology · Statistics 2018-09-26 Vincent Runge

Tensor B-spline methods are a high-performance alternative to solve partial differential equations (PDEs). This paper gives an overview on the principles of Tensor B-spline methodology, shows their use and analyzes their performance in…

Numerical Analysis · Computer Science 2019-04-08 Dmytro Shulga , Oleksii Morozov , Volker Roth , Felix Friedrich , Patrick Hunziker

Given two distinct reduced, irreducible curves of given degrees, contained in projective space but whose union is not contained in a hyperplane, what is the largest number of points of intersection they can have? When the projective space…

We study the symmetric outer product decomposition which decomposes a fully (partially) symmetric tensor into a sum of rank-one fully (partially) symmetric tensors. We present iterative algorithms for the third-order partially symmetric…

Numerical Analysis · Mathematics 2013-12-31 Na Li , Carmeliza Navasca

We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a…

Dynamical Systems · Mathematics 2026-03-30 Andy Hammerlindl , Natalia McAlister , Warwick Tucker

Normal multi-scale transform [4] is a nonlinear multi-scale transform for representing geometric objects that has been recently investigated [1, 7, 10]. The restrictive role of the exact order of polynomial reproduction $P_e$ of the…

Numerical Analysis · Mathematics 2013-11-19 Stanislav Harizanov

Partite, $3$-uniform hypergraphs are $3$-uniform hypergraphs in which each hyperedge contains exactly one point from each of the $3$ disjoint vertex classes. We consider the degree sequence problem of partite, $3$-uniform hypergraphs, that…

Combinatorics · Mathematics 2023-08-28 Andras Hubai , Tamas Robert Mezei , Ferenc Beres , Andras Benczur , Istvan Miklos

We show how to test the bipartiteness of an intersection graph of n line segments or simple polygons in the plane, or of balls in R^d, in time O(n log n). More generally we find subquadratic algorithms for connectivity and bipartiteness…

Computational Geometry · Computer Science 2009-05-23 David Eppstein
‹ Prev 1 3 4 5 6 7 10 Next ›