Results 1  10
of
15
What makes a Tree a Straight Skeleton?∗
"... Let G be a cyclefree connected straightline graph with predefined edge lengths and fixed order of incident edges around each vertex. We address the problem of deciding whether there exists a simple polygon P such that G is the straight skeleton of P. We show that for given G such a polygon P migh ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let G be a cyclefree connected straightline graph with predefined edge lengths and fixed order of incident edges around each vertex. We address the problem of deciding whether there exists a simple polygon P such that G is the straight skeleton of P. We show that for given G such a polygon P
Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions
"... We consider the question under which circumstances the straight skeleton and the Voronoi diagram of a given input shape coincide. More precisely, we investigate convex distance functions that stem from centrally symmetric convex polyhedra as unit balls and derive sufficient and necessary conditio ..."
Abstract
 Add to MetaCart
We consider the question under which circumstances the straight skeleton and the Voronoi diagram of a given input shape coincide. More precisely, we investigate convex distance functions that stem from centrally symmetric convex polyhedra as unit balls and derive sufficient and necessary
Title: Variable Offseƫng of Polygonal Structures Using Skeletons
"... Offseƫng is an important task in diverse applicaƟons in the manufacturing business. For a set C in the Euclidean plane, the constantradius offset with offset distance r is the set of all points of the plane whose minimum distance from C is exactly r. Formally, this offset curve can be defined as th ..."
Abstract
 Add to MetaCart
efficiently and reliably. Mitered offsets differ from constantradius offsets in the handling of nonconvex verƟces of an input polygon: Instead of adding circular arcs to the offset curve, the offset segments of the two edges incident to a nonconvex vertex get extended unƟl they intersect. This type
Generalized Offsetting Using a VariableRadius Voronoi Diagram
"... We investigate ways to extend offsetting based on skeletal structures beyond the wellknown constantradius and mitered offsets supported by Voronoi diagrams and straight skeletons for which the orthogonal distance of offset elements to their input elements is uniform. We introduce a new geometric ..."
Abstract
 Add to MetaCart
We investigate ways to extend offsetting based on skeletal structures beyond the wellknown constantradius and mitered offsets supported by Voronoi diagrams and straight skeletons for which the orthogonal distance of offset elements to their input elements is uniform. We introduce a new geometric
Invited Speakers
"... This volume contains the proceedings of the 25th Canadian Conference on Computational Geometry (CCCG’13), held in ..."
Abstract
 Add to MetaCart
This volume contains the proceedings of the 25th Canadian Conference on Computational Geometry (CCCG’13), held in
(Special Interest Group on Software Engineering)
"... Personal use of the material is permitted. Preface FMCAD 2010, held in Lugano Switzerland on October 2023, was the tenth in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and ind ..."
Abstract
 Add to MetaCart
Personal use of the material is permitted. Preface FMCAD 2010, held in Lugano Switzerland on October 2023, was the tenth in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computeraided system design including verification, specification, synthesis, and testing. In the past, FMCAD was held in the United States on even years and its sister conference, CHARME, was held in Europe on odd years. The conferences
Jeff Molofee's OpenGL Windows Tutorials Tutorial Index
"... The tutorials on this page may contain mistakes, poor commenting, and should not be considered the best resource to learn OpenGL from. What you do with the code is up to you. I am merely trying to make the learning process a little easier for those people new to OpenGL. If you are serious about lear ..."
Abstract
 Add to MetaCart
The tutorials on this page may contain mistakes, poor commenting, and should not be considered the best resource to learn OpenGL from. What you do with the code is up to you. I am merely trying to make the learning process a little easier for those people new to OpenGL. If you are serious about learning OpenGL, you should spend the money and invest in the OpenGL Red Book (ISBN 0201461382) and OpenGL Blue Book (ISBN 0201461404). I have the second edition of each book, and although they can be difficult for the new OpenGL programmer to understand, they are by far the best books written on the subject of OpenGL. Another book I would recommend is the OpenGL Superbible, although opinions vary. It is also important that you have a solid understanding of the language you plan to use. Although I do comment the nonGL lines, I am selftaught, and may not always write proper or even good code. It's up to you to take what you have learned from this site and apply it to projects of your own. Play around with the code, read books, ask me questions if need be. Once you have surpassed the code on this site or even before, check out more professional sites, such as Nate's Programming Page or OpenGL.org. Although Nate's site is inactive at the moment, it contains tons of excellent example programs, that are well written, and really show off what OpenGL is capable of. Also be sure to visit the many OpenGL links on my page.
Results 1  10
of
15