Parallel ips on planar triangulations
نویسندگان
چکیده
In this paper, we analyze ips over triangulations. Given a convex quadrilateral divided into two triangles in the triangulation, a ip consists in removing the triangle and replacing them by the two whose common side is the opposite diagonal. A parallel ip is a series of ips on disjoint quadrilaterals performed at the same time. We analyze the number of parallel ips that are necessary to transform any triangulation into another, and show that it can be performed in O(n) steps; this bound is tight. We also study a class of heuristics that give simple ways to compute a parallel ip, and show various results on them.
منابع مشابه
Simultaneous edge ipping in triangulations
We generalize the operation of ipping an edge in a triangulation to that of ipping several edges simultaneously. Our main result is an optimal upper bound on the number of parallel ips that are needed to transform a triangulation into another. Our results hold for triangulations of point sets and for polygons.
متن کاملTriangulations with Very Few Geometric Bistellar Neighbors
We are interested in a notion of elementary change between triangulations of a point connguration, the so-called bistellar ips, introduced by Gel'fand, Kapranov and Zelevinski. We construct sequences of triangulations of point conngurations in dimension 3 with n 2 +2n+2 vertices and only 4n?3 geometric bistellar ips (for every even integer n), and of point conngurations in dimension 4 with arbi...
متن کاملTriangle Graphs
We introduce a new class of planar graphs called triangle graphs. First, we present a formal way of constructing and characterizing triangle graphs, and then show that they characterize the adjacencies of arbitrary triangulations and they are three-colorable for a certain subclass of triangulations. Subsequently, we discuss an application of triangle graphs to the parallel nite element solution...
متن کاملOptimization of the Kinematic Sensitivity and the Greatest Continuous Circle in the Constant-orientation Workspace of Planar Parallel Mechanisms
This paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. This aim is approached upon proceeding single- and multi-objective optimization procedures. Kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...
متن کاملForward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning
The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...
متن کامل