A Convex De ien y Tree Algorithm for Curved Polygons
نویسنده
چکیده
منابع مشابه
A Convex Deficiency Tree Algorithm for Curved Polygons
Boolean set representations of curved two-dimensional polygons are expressions constructed from planar halfspaces and (possibly regularized) set operations. Such representations arise often in geometric modeling, computer vision, robotics, and computational mechanics. The convex de ciency tree (CDT) algorithm described in this paper constructs such expressions automatically for polygons bounded...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملOn the X-Y Convex Hull of a Set of X-Y Polygons
We study the class of rectilinear polygons, called X Y polygons, with horizontal and vertical edges, which are frequently used as building blocks for very large-scale integrated (VLSI) circuit layout and wiring. In the paper we introduce the notion of convexity within the.~class of X Y polygons and present efficient algorithms for computing the X Y convex hulls of an X Y polygon and of a set of...
متن کاملConvexhull of Curved Objects via Duality { a General Framework and an Optimal 2-d Algorithm
We address the problem of nding the convex hull of curved polyhedra in Euclidean spaces of nite dimension. Optimal algorithms for simple curved polygons in E 2 exist but the more general version of this problem seems missing from the literature. A precise deenition of the objects under consideration is given. It encompasses most interesting solids that could arise in practical applications of g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001