ESOLID—a system for exact boundary evaluation

We present a system, ESOLID, that performs exact boundary evaluation of low-degree curved solids in reasonable amounts of time. ESOLID performs accurate Boolean operations using exact representations and exact computations throughout. The demands of exact computation require a different set of algorithms and efficiency improvements than those found in a traditional inexact floating point based modeler. We describe the system architecture, representations, and issues in implementing the algorithms. We also describe a number of techniques that increase the efficiency of the system based on lazy evaluation, use of floating point filters, arbitrary floating point arithmetic with error bounds, and lower dimensional formulation of subproblems. ESOLID has been used for boundary evaluation of many complex solids. These include both synthetic datasets and parts of a Bradley Fighting Vehicle designed using the BRL-CAD solid modeling system. It is shown that ESOLID can correctly evaluate the boundary of solids that are very hard to compute using a fixed-precision floating point modeler. In terms of performance, it is about an order of magnitude slower as compared to a floating point boundary evaluation system on most cases

EFFICIENT POLYNOMIAL ROOT ISOLATION APPLIED TO COMPUTATIONAL GEOMETRY

Over the last several years, the field of polynomial root isolation has been rapidly improving, but the computational geometry applications have been somewhat unexplored. Here, we have an implementation of a curve intersection engine that showcases the current state-of-the-art in root isolation. The engine is capable of taking two implicitly defined curves and locating their intersection points within some required accuracy. From this work, we can clearly see that root isolation is no longer a significant speed issue in computational geometry. The next issue is really speed of the resultant computation used for variable eliminatio

EFFICIENT POLYNOMIAL ROOT ISOLATION APPLIED TO COMPUTATIONAL GEOMETRY

Over the last several years, the field of polynomial root isolation has been rapidly improving, but the computational geometry applications have been somewhat unexplored. Here, we have an implementation of a curve intersection engine that showcases the current state-of-the-art in root isolation. The engine is capable of taking two implicitly defined curves and locating their intersection points within some required accuracy. From this work, we can clearly see that root isolation is no longer a significant speed issue in computational geometry. The next issue is really speed of the resultant computation used for variable eliminatio

A survey of free software for the design, analysis, modelling, and simulation of an unmanned aerial vehicle

The objective of this paper is to analyze free software for the design, analysis, modelling, and simulation of an unmanned aerial vehicle (UAV). Free software is the best choice when the reduction of production costs is necessary; nevertheless, the quality of free software may vary. This paper probably does not include all of the free software, but tries to describe or mention at least the most interesting programs. The first part of this paper summarizes the essential knowledge about UAVs, including the fundamentals of flight mechanics and aerodynamics, and the structure of a UAV system. The second section generally explains the modelling and simulation of a UAV. In the main section, more than 50 free programs for the design, analysis, modelling, and simulation of a UAV are described. Although the selection of the free software has been focused on small subsonic UAVs, the software can also be used for other categories of aircraft in some cases; e.g. for MAVs and large gliders. The applications with an historical importance are also included. Finally, the results of the analysis are evaluated and discussed—a block diagram of the free software is presented, possible connections between the programs are outlined, and future improvements of the free software are suggested. © 2015, CIMNE, Barcelona, Spain.Internal Grant Agency of Tomas Bata University in Zlin [IGA/FAI/2015/001, IGA/FAI/2014/006

genmitsu ni seikakuna enzan o mochiita soriddo moderingu ni kansuru kenkyu

制度:新 ; 文部省報告番号:甲1919号 ; 学位の種類:博士(工学) ; 授与年月日:2004/3/4 ; 早大学位記番号:新379

Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere

We present two exact implementations of efficient output-sensitive algorithms that compute Minkowski sums of two convex polyhedra in 3D. We do not assume general position. Namely, we handle degenerate input, and produce exact results. We provide a tight bound on the exact maximum complexity of Minkowski sums of polytopes in 3D in terms of the number of facets of the summand polytopes. The algorithms employ variants of a data structure that represents arrangements embedded on two-dimensional parametric surfaces in 3D, and they make use of many operations applied to arrangements in these representations. We have developed software components that support the arrangement data-structure variants and the operations applied to them. These software components are generic, as they can be instantiated with any number type. However, our algorithms require only (exact) rational arithmetic. These software components together with exact rational-arithmetic enable a robust, efficient, and elegant implementation of the Minkowski-sum constructions and the related applications. These software components are provided through a package of the Computational Geometry Algorithm Library (CGAL) called Arrangement_on_surface_2. We also present exact implementations of other applications that exploit arrangements of arcs of great circles embedded on the sphere. We use them as basic blocks in an exact implementation of an efficient algorithm that partitions an assembly of polyhedra in 3D with two hands using infinite translations. This application distinctly shows the importance of exact computation, as imprecise computation might result with dismissal of valid partitioning-motions.Comment: A Ph.D. thesis carried out at the Tel-Aviv university. 134 pages long. The advisor was Prof. Dan Halperi