English
Related papers

Related papers: Orthologic Tetrahedra with Intersecting Edges

200 papers

This article answers an important theoretical question: How many different subdivisions of the hexahedron into tetrahedra are there? It is well known that the cube has five subdivisions into 6 tetrahedra and one subdivision into 5…

Computational Geometry · Computer Science 2018-12-14 Jeanne Pellerin , Kilian Verhetsel , Jean-Francois Remacle

We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.

Metric Geometry · Mathematics 2012-03-14 J. Konarzewski , M. Żynel

Let $S$ be a set of $n$ points in 3-dimensional space. A tetrahedralization $\mathcal{T}$ of $S$ is a set of interior disjoint tetrahedra with vertices on $S$, not containing points of $S$ in their interior, and such that their union is the…

Computational Geometry · Computer Science 2012-10-22 Francisco Escalona , Ruy Fabila-Monroy , Jorge Urrutia

A pair of planes, both projective or both affine, of the same order and on the same pointset are orthogoval if each line of one plane intersects each line of the other plane in at most two points. In this paper we prove new constructions…

Combinatorics · Mathematics 2022-10-24 Charles J. Colbourn , Colin Ingalls , Jonathan Jedwab , Mark Saaltink , Ken W. Smith , Brett Stevens

In this paper we present the construction of several aggregates of tetrahedra. Each construction is obtained by performing rotations on an initial set of tetrahedra that either (1) contains gaps between adjacent tetrahedra, or (2) exhibits…

Metric Geometry · Mathematics 2013-04-08 Fang Fang , Klee Irwin , Julio Kovacs , Garrett Sadler

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is established for infinite classes of triples of tetrahedra.

Computational Geometry · Computer Science 2011-06-09 Joseph O'Rourke

Edge-to-edge tilings of the sphere by congruent quadrilaterals are completely classified in a series of three papers. This second one applies the powerful tool of trigonometric Diophantine equations to classify the case of…

Combinatorics · Mathematics 2023-06-06 Yixi Liao , Erxiao Wang

A tetrahedral curve is a space curve whose defining ideal is an intersection of powers of monomial prime ideals of height two. It is supported on a tetrahedral configuration of lines. Schwartau described when certain such curves are ACM,…

Commutative Algebra · Mathematics 2007-05-23 Juan C. Migliore , Uwe Nagel

Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…

Combinatorics · Mathematics 2007-05-23 Stefan Felsner , Sarah Kappes

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected "edge" unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of…

Computational Geometry · Computer Science 2008-10-06 Alexey S Tarasov

A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular but "fails geometric regularity by a factor of 2"; its combinatorial automorphism group is flag-transitive but its geometric…

Metric Geometry · Mathematics 2010-05-27 Anthony M. Cutler , Egon Schulte

For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…

Combinatorics · Mathematics 2022-08-10 Olimjoni Pirahmad , Alexandr Polyanskii , Alexey Vasilevskii

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

Metric Geometry · Mathematics 2009-06-08 Daniel Pellicer , Egon Schulte

In his paper "Shapes of Polyhedra and Triangulations of the Sphere", Thurston found that the set of shapes of convex polyhedra with prescribed cone-deficits has a complex hyperbolic structure. Inspired by his work, this paper studies the…

Geometric Topology · Mathematics 2018-11-19 Zili Wang

The edge-to-edge tilings of the sphere by congruent quadrilaterals of Type $a^2bc$ are classified as $3$ classes: a sequence of two-parameter families of $2$-layer earth map tilings with $2n$ $(n\ge3)$ tiles, a one-parameter family of…

Combinatorics · Mathematics 2022-07-26 Yixi Liao , Pinren Qian , Erxiao Wang , Yingyun Xu

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

Combinatorics · Mathematics 2015-09-08 Nathan Reff

An orthogonality space is a set equipped with a symmetric, irreflexive relation called orthogonality. Every orthogonality space has an associated complete ortholattice, called the logic of the orthogonality space. To every poset, we…

Rings and Algebras · Mathematics 2024-11-20 Gejza Jenča

If we label the vertices of a triangle with 1, 2 and 4, and the orthocentre with 7, then any of the four numbers 1, 2, 4, 7 is the nim-sum of the other three and is their orthocentre. Regard the triangle as an orthocentric quadrangle.…

History and Overview · Mathematics 2019-10-09 Richard K. Guy

By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…

Combinatorics · Mathematics 2010-02-15 Radoslav Fulek , Balázs Keszegh , Filip Morić
‹ Prev 1 3 4 5 6 7 10 Next ›