Geometry and Topology Commons^™

Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Abstract. This paper can be used in two ways. It can provide reference information for incorporating diagonal elements (for bracing or gear meshing) in educational robots built from standard LEGO kits. Alternatively, it can be used as the basis for an assignment for high school or college students to recreate this information; in the process, students will exercise skills in both computer programming and data analysis. Using the paper in the second way can be an excellent integrative experience to add to an existing course; for example, the Exploring Computer Science high school curriculum concludes with the units “Introduction to …

Normal Surfaces And 3-Manifold Algorithms, Josh D. Hews

Honors Theses

This survey will develop the theory of normal surfaces as they apply to the S3 recognition algorithm. Sections 2 and 3 provide necessary background on manifold theory. Section 4 presents the theory of normal surfaces in triangulations of 3-manifolds. Section 6 discusses issues related to implementing algorithms based on normal surfaces, as well as an overview of the Regina, a program that implements many 3-manifold algorithms. Finally section 7 presents the proof of the 3-sphere recognition algorithm and discusses how Regina implements the algorithm.

Long And Short-Range Air Navigation On Spherical Earth, Nihad E. Daidzic

International Journal of Aviation, Aeronautics, and Aerospace

Global range air navigation implies non-stop flight between any two airports on Earth. Such effort would require airplanes with the operational air range of at least 12,500 NM which is about 40-60% longer than anything existing in commercial air transport today. Air transportation economy requires flying shortest distance, which in the case of spherical Earth are Orthodrome arcs. Rhumb-line navigation has little practical use in long-range flights, but has been presented for historical reasons and for comparison. Database of about 50 major international airports from every corner of the world has been designed and used in testing and route validation. …

Ε-Kernel Coresets For Stochastic Points, Haitao Wang, Lingxiao Huang, Jian Li, Jeff Mark Phillips

Computer Science Faculty and Staff Publications

With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over such data. In this paper, we initiate the study of constructing epsilon-kernel coresets for uncertain points. We consider uncertainty in the existential model where each point's location is fixed but only occurs with a certain probability, and the locational model where each point has a probability distribution describing its location. An epsilon-kernel coreset approximates the width of a point set in any direction. We consider approximating the …

Unfolding Convex Polyhedra Via Radially Monotone Cut Trees, Joseph O'Rourke

Computer Science: Faculty Publications

A notion of "radially monotone" cut paths is introduced as an effective choice for finding a non-overlapping edge-unfolding of a convex polyhedron. These paths have the property that the two sides of the cut avoid overlap locally as the cut is infinitesimally opened by the curvature at the vertices along the path. It is shown that a class of planar, triangulated convex domains always have a radially monotone spanning forest, a forest that can be found by an essentially greedy algorithm. This algorithm can be mimicked in 3D and applied to polyhedra inscribed in a sphere. Although the algorithm does …

Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper provides tips for LEGO robot construction involving bracing or gear meshing along a diagonal using standard Botball kits.

Geometric Deformations Of Sodalite Frameworks, Ciprian Borcea, Ileana Streinu

Computer Science: Faculty Publications

In mathematical crystallography and computational materials science, it is important to infer flexibility properties of framework materials from their geometric representation. We study combinatorial, geometric and kinematic properties for frameworks modeled on sodalite.

Algorithmic Foundations Of Heuristic Search Using Higher-Order Polygon Inequalities, Newton Henry Campbell Jr.

CCAC Theses and Dissertations

The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms that use preprocessed landmark information and the triangle inequality to guide A* search in graphs. A new heuristic is presented for solving shortest path queries that enables the use of higher order polygon inequalities. We demonstrate this capability by leveraging distance information from two landmarks when visiting a vertex as opposed to the common single landmark …

Hypercube Unfoldings That Tile R3 And R2, Giovanna Diaz, Joseph O'Rourke

Computer Science: Faculty Publications

We show that the hypercube has a face-unfolding that tiles space, and that unfolding has an edge-unfolding that tiles the plane. So the hypercube is a "dimension-descending tiler." We also show that the hypercube cross unfolding made famous by Dali tiles space, but we leave open the question of whether or not it has an edge-unfolding that tiles the plane.

Spiral Unfoldings Of Convex Polyhedra, Joseph O'Rourke

Computer Science: Faculty Publications

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic polyhedra, overlap is more the rule than the exception. The structure of spiral unfoldings is investigated, primarily by analyzing one particular class, the polyhedra of revolution.

Non-Orientable Objects As Gaming Surfaces, Haley P. Bourke, Paul Latiolais

Student Research Symposium

Developed in Python, Klein Space Fighter is an interactive learning tool and mathematically themed arcade game that allows the player to combat on different mathematical surfaces including a 2D Klein bottle. The app is available for Android and desktop devices, and will be made available for iOS in the future.

To receive an invitation to download the app through Google Play, contact me at [email protected]

Development Of A Tridimensional Measuring Application For Ipads, Michael Casebolt, Nicolas Kouatli, Jack Mullen

Computer Science and Software Engineering

In today’s fast-paced distribution centers workers and management alike are constantly searching for the quickest and most efficient way to package items for distribution. Even with the advancement of app-oriented solutions to a variety of problems across many industries there is a distinct unmet need in distribution environments for an application capable of increasing the efficiency and accuracy of packaging items. This senior project focused on the development and testing of an application utilizing the Structure Three Dimensional Sensor and a 4th generation iPad to scan an object or group of objects to be packaged and determine the overall dimensions …

Efficient Estimation Of Cluster Population, Sanjeev K C

UNLV Theses, Dissertations, Professional Papers, and Capstones

Partitioning a given set of points into clusters is a well known problem in pattern recognition, data mining, and knowledge discovery. One of the well known methods for identifying clusters in Euclidean space is the K-mean algorithm. In using the K-mean clustering algorithm it is necessary to know the value of k (the number of clusters) in advance. We propose to develop algorithms for good estimation of k for points distributed in two dimensions. The techniques we pursue include a bucketing method, g-hop neighbors, and Voronoi diagrams. We also present experimental results for examining the performances of the bucketing method …

Topological Manifolds, Grant Wilson

Thinking Matters Symposium Archive

Topological Manifolds are abstract spaces that locally resemble Euclidean space. For example, consider a round globe and a flat map. The map is a 2-dimensional representation of a 3-dimensional space. Given any point on the globe we can find a corresponding position on the map, and vice versa. This correspondence is called a chart. With a sufficient number of charts, we can describe the whole space. Such a collection of charts is called an Atlas. It is possible to construct different Atlases for the same space, allowing us to move from one chart, to the space, to another chart. This …

Approaches For Generating 2d Shapes, Pratik Shankar Hada

UNLV Theses, Dissertations, Professional Papers, and Capstones

Constructing a two dimensional shape from given a set of point sites is a well known problem in computation geometry. We present a critical review of the existing algorithms for constructing polygonal shapes. We present a new approach calledinward dentingfor constructing simple polygons. We then extend the proposed approach for modeling polygons with holes. This is the

first known algorithm for modeling holes in the interior of 2d shapes. We also present experimental investigations of the quality of the solutions generated by the proposed algorithms.

For this we implemented the proposed algorithms in Java programming language. The prototype program can …

A Mathematical Framework For Unmanned Aerial Vehicle Obstacle Avoidance, Sorathan Chaturapruek

HMC Senior Theses

The obstacle avoidance navigation problem for Unmanned Aerial Vehicles (UAVs) is a very challenging problem. It lies at the intersection of many fields such as probability, differential geometry, optimal control, and robotics. We build a mathematical framework to solve this problem for quadrotors using both a theoretical approach through a Hamiltonian system and a machine learning approach that learns from human sub-experts' multiple demonstrations in obstacle avoidance. Prior research on the machine learning approach uses an algorithm that does not incorporate geometry. We have developed tools to solve and test the obstacle avoidance problem through mathematics.

A 2-Chain Can Interlock With An Open 10-Chain, Bin Lu, Joseph O'Rourke, Jianyuan K. Zhong

Computer Science: Faculty Publications

Abstract. It is an open problem, posed in [3], to determine the minimal k such that an open flexible k-chain can interlock with a flexible 2-chain. It was first established in [5] that there is an open 16-chain in a trapezoid frame that achieves interlocking. This was subsequently improved in [6] to establish interlocking between a 2-chain and an open 11-chain. Here we improve that result once more, establishing interlocking between a 2-chain and a 10-chain. We present arguments that indicate that 10 is likely the minimum.

Degree Constrained Triangulation, Roshan Gyawali

UNLV Theses, Dissertations, Professional Papers, and Capstones

Triangulation of simple polygons or sets of points in two dimensions is a widely investigated problem in computational geometry. Some researchers have considered variations of triangulation problems that include minimum weight triangulation, de-launay triangulation and triangulation refinement. In this thesis we consider a constrained version of the triangulation problem that asks for triangulating a given domain (polygon or point sites) so that the resulting triangulation has an increased number of even degree vertices. This problem is called Degree Constrained Triangulation (DCT). We propose four algorithms to solve DCT problems. We also present experimental results based on the implementation of the …

Unfolding Prismatoids As Convex Patches: Counterexamples And Positive Results, Joseph O'Rourke

Computer Science: Faculty Publications

We address the unsolved problem of unfolding prismatoids in a new context, viewing a “topless prismatoid” as a convex patch—a polyhedral subset of the surface of a convex polyhedron homeomorphic to a disk. We show that several natural strategies for unfolding a prismatoid can fail, but obtain a positive result for “petal unfolding” topless prismatoids. We also show that the natural extension to a convex patch consisting of a face of a polyhedron and all its incident faces, does not always have a nonoverlapping petal unfolding. However, we obtain a positive result by excluding the problematical patches. This then leads …

Source Unfoldings Of Convex Polyhedra Via Certain Closed Curves, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu

Computer Science: Faculty Publications

Abstract. We extend the notion of a source unfolding of a convex polyhedron P to be based on a closed polygonal curve Q in a particular class rather than based on a point. The class requires that Q “lives on a cone” to both sides; it includes simple, closed quasigeodesics. Cutting a particular subset of the cut locus of Q (in P) leads to a non-overlapping unfolding of the polyhedron. This gives a new general method to unfold the surface of any convex polyhedron to a simple, planar polygon

Modeling Spatial Uncertainties In Geospatial Data Fusion And Mining, Boris Kovalerchuk, Leonid Perlovsky, Michael Kovalerchuk

All Faculty Scholarship for the College of the Sciences

Geospatial data analysis relies on Spatial Data Fusion and Mining (SDFM), which heavily depend on topology and geometry of spatial objects. Capturing and representing geometric characteristics such as orientation, shape, proximity, similarity, and their measurement are of the highest interest in SDFM. Representation of uncertain and dynamically changing topological structure of spatial objects including social and communication networks, roads and waterways under the influence of noise, obstacles, temporary loss of communication, and other factors. is another challenge. Spatial distribution of the dynamic network is a complex and dynamic mixture of its topology and geometry. Historically, separation of topology and geometry …

Π/2-Angle Yao Graphs Are Spanners, Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel Smid, Stefanie Wuhrer

Computer Science: Faculty Publications

We show that the Yao graph Y₄ in the L₂ metric is a spanner with stretch factor 8(29+23√ 2). Enroute to this, we also show that the Yao graph Y^∞₄ in the L_∞ metric is a planar spanner with stretch factor 8.

Common Edge-Unzippings For Tetrahedra, Joseph O'Rourke

Computer Science: Faculty Publications

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.

Sharp Feature Identification In A Polygon, Joseph P. Scanlan

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis presents an efficient algorithm for recognizing and extracting sharp-features from polygonal shapes. As used here, a sharp-feature is a distinct portion of a polygon that is long and skinny. The algorithm executes in O(n^2) time, where n is the number of vertices in the polygon. Experimental results from a Java implementation of the algorithm are also presented.

Conical Existence Of Closed Curves On Convex Polyhedra, Joseph O'Rourke, Costin Vîlcu

Computer Science: Faculty Publications

Let C be a simple, closed, directed curve on the surface of a convex polyhedron P. We identify several classes of curves C that "live on a cone," in the sense that C and a neighborhood to one side may be isometrically embedded on the surface of a cone Lambda, with the apex a of Lambda enclosed inside (the image of) C; we also prove that each point of C is "visible to" a. In particular, we obtain that these curves have non-self-intersecting developments in the plane. Moreover, the curves we identify that live on cones to both sides support …

Flat Zipper-Unfolding Pairs For Platonic Solids, Joseph O'Rourke

Computer Science: Faculty Publications

We show that four of the five Platonic solids' surfaces may be cut open with a Hamiltonian path along edges and unfolded to a polygonal net each of which can "zipper-refold" to a flat doubly covered parallelogram, forming a rather compact representation of the surface. Thus these regular polyhedra have particular flat "zipper pairs." No such zipper pair exists for a dodecahedron, whose Hamiltonian unfoldings are "zip-rigid." This report is primarily an inventory of the possibilities, and raises more questions than it answers.

On Folding A Polygon To A Polyhedron, Joseph O'Rourke

Computer Science: Faculty Publications

We show that the open problem presented in "Geometric Folding Algorithms: Linkages, Origami, Polyhedra" [DO07] is solved by a theorem of Burago and Zalgaller [BZ96] from more than a decade earlier.

On Flat Polyhedra Deriving From Alexandrov's Theorem, Joseph O'Rourke

Computer Science: Faculty Publications

We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in O(n³) time for polygons whose gluings are specified by n labels.

Star Unfolding Convex Polyhedra Via Quasigeodesic Loops, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu

Computer Science: Faculty Publications

We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ℘ to a simple (nonoverlapping) planar polygon: cut along one shortest path from each vertex of ℘ toQ, and cut all but one segment of Q.

The Yao Graph Y6 Is A Spanner, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that Y₆ is a spanner. Y₆ is the Yao graph on a set of planar points, which has an edge from each point x to a closest point y within each of the six angular cones of 60^◦ surrounding x .