English
Related papers

Related papers: Towards Plane Spanners of Degree 3

200 papers

This paper considers an extension of origami geometry to the case of "folding" a three dimensional (3D) space along a plane. First, all possible incidence constraints between given points, lines and planes are analyzed by using the geometry…

History and Overview · Mathematics 2018-09-18 Jorge C. Lucero

A planar orthogonal drawing $\Gamma$ of a planar graph $G$ is a geometric representation of $G$ such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and no two…

Data Structures and Algorithms · Computer Science 2019-10-28 Walter Didimo , Giuseppe Liotta , Giacomo Ortali , Maurizio Patrignani

We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…

Computational Geometry · Computer Science 2007-05-23 Jeff Danciger , Satyan L. Devadoss , Don Sheehy

We generalize the three two-particle Bethe-Salpeter equations to ten three-particle ladders. These equations are exact and yield the exact three-particle vertex, if we knew the three-particle vertex irreducible in one of the ten channels.…

Other Condensed Matter · Physics 2024-12-04 Patrick Kappl , Tin Ribic , Anna Kauch , Karsten Held

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Computational Geometry · Computer Science 2017-08-22 Sergey Bereg , Matias Korman , Rodrigo I. Silveira , Ferran Hurtado , Dolores Lara , Jorge Urrutia , Mikio Kano , Carlos Seara , Kevin Verbeek

In hyperbolic space, the angle of intersection and distance classify pairs of totally geodesic hyperplanes. A similar algebraic invariant classifies pairs of hyperplanes in the Einstein universe. In dimension 3, symplectic splittings of a…

Differential Geometry · Mathematics 2019-09-17 Jean-Philippe Burelle , Virginie Charette , Dominik Francoeur , William Goldman

A method to construct trihamiltonian extensions of a separable system is presented. The procedure is tested for systems, with a natural Hamiltonian, separable in classical sense in one of the four orthogonal separable coordinate systems of…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 Luca Degiovanni

We propose a simple numerical method which computes an approximate value of the winding number of a mapping from 3D torus~$T^3$ to the unitary group~$U(N)$, when $T^3$ is approximated by discrete lattice points. Our method consists of a…

High Energy Physics - Lattice · Physics 2024-12-12 Okuto Morikawa , Hiroshi Suzuki

Let $S\subset \mP^4$ be a general K3 surface of degree 6 and genus 4. In this paper we study the irreducible variety $X_S$ of \emph{tritangential planes} to $S$ whose general point is a plane that intersects $S$ in a curvilinear scheme of…

Algebraic Geometry · Mathematics 2024-06-04 Ciro Ciliberto , Alessandro Verra

This article focuses on the occurrence of 3-point configurations in subsets of $\mathbb{R}^d$ of sufficient thickness. We prove that a compact set $A\subset \mathbb{R}^d$ contains a similar copy of any linear $3$-point configuration (such…

Classical Analysis and ODEs · Mathematics 2026-03-09 Samantha Sandberg-Clark , Krystal Taylor

Plane arrangements are a useful tool for surface and volume modelling. However, their main drawback is poor scalability. We introduce two key novelties that enable the construction of plane arrangements for complex objects and entire…

Computational Geometry · Computer Science 2024-07-12 Raphael Sulzer , Florent Lafarge

We study the change of the minimal degree of a logarithmic derivation of a hyperplane arrangement under the addition or the deletion of a hyperplane, and give a number of applications. First, we prove the existence of Tjurina maximal line…

Algebraic Geometry · Mathematics 2019-09-17 Takuro Abe , Alexandru Dimca , Gabriel Sticlaru

Given $mp$ different $p$-planes in general position in $(m+p)$-dimensional space, a classical problem is to ask how many $p$-planes intersect all of them. For example when $m = p = 2$, this is precisely the question of "lines meeting four…

Algebraic Topology · Mathematics 2022-06-03 Thomas Brazelton

Many man-made objects are characterised by a shape that is symmetric along one or more planar directions. Estimating the location and orientation of such symmetry planes can aid many tasks such as estimating the overall orientation of an…

Computer Vision and Pattern Recognition · Computer Science 2021-07-01 Mihaela Cătălina Stoian , Tommaso Cavallari

The Milnor degree of a 3-manifold is an invariant that records the maximum simplicity, in terms of higher order linking, of any link in the 3-sphere that can be surgered to give the manifold. This invariant is investigated in the context of…

Geometric Topology · Mathematics 2014-02-26 Tim Cochran , Paul Melvin

We present a new model of a non-Euclidean plane, in which angles in a triangle sum up to $\pi$. It is a subspace of the Cartesian plane over the field of hyperreal numbers $\mathbb{R}^*$. The model enables one to represent the negation of…

History and Overview · Mathematics 2023-02-27 Piotr Błaszczyk , Anna Petiurenko

We show that finding orthogonal grid-embeddings of plane graphs (planar with fixed combinatorial embedding) with the minimum number of bends in the so-called Kandinsky model (which allows vertices of degree $> 4$) is NP-complete, thus…

Computational Geometry · Computer Science 2014-05-12 Thomas Bläsius , Guido Brückner , Ignaz Rutter

This paper investigates the cuspidal configurations of 3-RPR parallel manipulators that may appear on their singular surfaces in the joint space. Cusp points play an important role in the kinematic behavior of parallel manipulators since…

Robotics · Computer Science 2010-12-14 Guillaume Inria Moroz , Fabrice Rouiller , Damien Chablat , Philippe Wenger

We obtain new upper and lower bounds on the number of unit perimeter triangles spanned by points in the plane. We also establish improved bounds in the special case where the point set is a section of the integer grid.

Combinatorics · Mathematics 2025-10-06 Ritesh Goenka , Kenneth Moore , Ethan Patrick White

A tetrahedral complex all of whose tetrahedra meet at a common vertex is called a \textit{vertex star}. Vertex stars are a natural generalization of planar triangulations, and understanding splines on vertex stars is a crucial step to…

Combinatorics · Mathematics 2020-05-28 Michael DiPasquale , Nelly Villamizar