SearcharxivSearch

arXiv · 1803.09498

Alternative interpretation of the Pl\"ucker quadric's ambient space and its application

Abstract

It is well-known that there exists a bijection between the set of lines of the projective 3-dimensional space $P^3$ and all real points of the so-called Pl\"ucker quadric $\Psi$. Moreover one can identify each point of the Pl\"ucker quadric's ambient space with a linear complex of lines in $P^3$. Within this paper we give an alternative interpretation for the points of $P^5$ as lines of an Euclidean 4-space $E^4$, which are orthogonal to a fixed direction. By using the quaternionic notation for lines, we study straight lines in $P^5$ which correspond in the general case to cubic 2-surfaces in $E^4$. We show that these surfaces are geometrically connected with circular Darboux 2-motions in $E^4$, as they are basic surfaces of the underlying line-symmetric motions. Moreover we extend the obtained results to line-elements of the Euclidean 3-space $E^3$, which can be represented as points of a cone over $\Psi$ sliced along the 2-dimensional generator space of ideal lines. We also study straight lines of its ambient space $P^6$ and show that they correspond to ruled surface strips composed of the mentioned 2-surfaces with circles on it. Finally we present an application of this interpretation in the context of interactive design of ruled surfaces and ruled surface strips/patches based on the algorithm of De Casteljau.

Explore related subjects

Keep this discovery

BibTeXRIS

Georg Nawratil. 2018-03-26. Alternative interpretation of the Pl\"ucker quadric's ambient space and its application. https://arxiv.org/abs/1803.09498

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Almost Linear Universal Point Sets for Planar Graphs

A point set is universal for planar graphs on $n$ vertices if every such graph has a straight-line drawing without crossings whose vertices belong to the set. We construct universal point sets of size $n^{1+o(1)}$, improving the previous quadratic upper bound. Our construction uses the reduction of Bannister, Cheng, Devanny, and Eppstein from universal point sets to superpatterns for $213$-avoiding permutations. We represent these permutations by ordered rooted forests and construct a small family of intervals containing every such forest. The result follows from a straightforward bound on the size of the family of intervals. GPT-6 Astra assisted in developing the construction and proof.

cs.CG

Some results on Archdeacon's conjecture for rotation systems

A rotation system on $n$ elements assigns to each element a cyclic order of the other $n-1$ elements. A four-element subset is non-planar if its induced rotation system cannot be realized by a crossing-free drawing of $K_4$. As a combinatorial strengthening of Hill's conjecture on the crossing number of the complete graph, Archdeacon conjectured that every rotation system on $n$ elements has at least $H(n)=\frac{1}{4} \lfloor\frac {n}{2}\rfloor \lfloor\frac{n-1}{2}\rfloor \lfloor\frac{n-2}{2}\rfloor \lfloor\frac{n-3}{2}\rfloor$ non-planar four-element subsets. We computationally verify Archdeacon's conjecture for $n\leq 10$ and show that every extremal rotation system in these orders is realizable by a simple drawing. With computer assistance, we prove that every rotation system on $n$ elements has at least $(8/9 - o(1)) H(n)$ non-planar four-element subsets. We also present a proof by hand for a weaker lower bound of $(2/3-o(1)) H(n)$. Finally, extending recent work of Felsner on antipodal pairs in drawings, we show that Archdeacon's conjecture holds for antipodally shellable rotation systems.

cs.CG

The Hyperbolic Surface Distance, Diameter, and Dirichlet Problems

Despite the prominence of hyperbolic surfaces in mathematics, basic algorithmic questions about them, even computing the distance between two points, have remained open, leaving many features of these surfaces inaccessible. The classical machinery assumes a polyhedral structure absent on a smooth surface. We remove these obstacles. We begin with an efficient $O(g^2)$ algorithm for the distance between two points, where $g$ is the genus of the surface. Building on it, we obtain an $O(g^2 \log g)$ method for answering distance queries from a fixed source and, as a consequence, for recentering a Dirichlet domain around an arbitrary point. This understanding of distances on the surface then lets us approximate the diameter to within any $\eps$ in time $O(g^3 \log g / \eps^2)$. We further show that the diameter, a single real number encoding a great deal about the surface, is exactly computable. Its hyperbolic cosine is an algebraic number over the field encoding the coefficients of the hyperbolic isometries defining the surface.

cs.CG