Results 1  10
of
523
Motorcycle Graphs and Straight Skeletons
, 2002
"... We present a new algorithm to compute a motorcycle graph. It runs in O(n p n log n) time when n is the size of the input. We give a new characterization of the straight skeleton of a polygon possibly with holes. ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
We present a new algorithm to compute a motorcycle graph. It runs in O(n p n log n) time when n is the size of the input. We give a new characterization of the straight skeleton of a polygon possibly with holes.
Motorcycle Graphs and Straight Skeletons\Lambda
, 2005
"... Abstract We present a new algorithm to compute motorcycle graphs. It runs in O(npn log n) timewhen n is the number of motorcycles. We give a new characterization of the straight skeletonof a nondegenerate polygon. For a polygon with n vertices and h holes, we show that ityields a randomized algorit ..."
Abstract
 Add to MetaCart
algorithm that reduces the straight skeleton computation to a motorcycle graph computation in expected O(n p h + 1 log2 n) time. Combining these results, we cancompute the straight skeleton of a nondegenerate polygon with h holes and with n vertices,among which r are reflex vertices, in O(n p h + 1 log2 n
Computing Straight Skeletons of Planar StraightLine Graphs Based on Motorcycle Graphs
, 2010
"... We present a simple algorithm for computing straight skeletons of planar straightline graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefrontpropagation algorithm that circumvents the expensive search for the next split event. Our algorithm maint ..."
Abstract
 Add to MetaCart
We present a simple algorithm for computing straight skeletons of planar straightline graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefrontpropagation algorithm that circumvents the expensive search for the next split event. Our algorithm
Approximating a Motorcycle Graph by a Straight Skeleton
"... We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straightline graph G such that the straight skeleton of G reveals the motorcycle graph of M, for every given finite set M of motorcycles. An application of our construction is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straightline graph G such that the straight skeleton of G reveals the motorcycle graph of M, for every given finite set M of motorcycles. An application of our construction
Faster Reductions from Straight Skeletons to Motorcycle Graphs
"... We give an algorithm that reduces the straight skeleton to the motorcycle graph in O(n log n) time for (weakly) simple polygons and O(n(log n) logm) time for a planar straight line graph with m connected components. The current fastest algorithms for computing motorcycle graphs are an O(n4/3+) time ..."
Abstract
 Add to MetaCart
We give an algorithm that reduces the straight skeleton to the motorcycle graph in O(n log n) time for (weakly) simple polygons and O(n(log n) logm) time for a planar straight line graph with m connected components. The current fastest algorithms for computing motorcycle graphs are an O(n4
A Faster Algorithm for Computing Straight Skeletons
, 2014
"... We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n vertices, among which r are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in O(n(logn) log r) time. It improves on t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a new algorithm for computing the straight skeleton of a polygon. For a polygon with n vertices, among which r are reflex vertices, we give a deterministic algorithm that reduces the straight skeleton computation to a motorcycle graph computation in O(n(logn) log r) time. It improves
A faster algorithm for computing motorcycle graphs
 PROC. 29TH SYMP. ON COMPUTATIONAL GEOMETRY, SOCG ’13, ACM
, 2013
"... We present a new algorithm for computing motorcycle graphs that runs in O(n4/3+ε) time for any ε> 0, improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a nondegener ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We present a new algorithm for computing motorcycle graphs that runs in O(n4/3+ε) time for any ε> 0, improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a non
Computing Motorcycle Graphs Based on Kinetic Triangulations∗
"... We present an efficient algorithm for computing generalized motorcycle graphs, in which motorcycles are allowed to emerge after time zero. Our algorithm applies kinetic triangulations inside of the convex hull of the input, while a plane sweep is used outside of it. Its worstcase complexity is O( ..."
Abstract
 Add to MetaCart
We present an efficient algorithm for computing generalized motorcycle graphs, in which motorcycles are allowed to emerge after time zero. Our algorithm applies kinetic triangulations inside of the convex hull of the input, while a plane sweep is used outside of it. Its worstcase complexity is O
Motorcycle Graphs: Canonical Quad Mesh Partitioning
, 2008
"... We describe algorithms for canonically partitioning semiregular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes. Our partitions may be used to efficiently find isomorphisms between quad meshes. In addition ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
We describe algorithms for canonically partitioning semiregular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein and Erickson to quad meshes. Our partitions may be used to efficiently find isomorphisms between quad meshes
Computing the Straight Skeleton of a Monotone Polygon in O(nlogn) Time
"... The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in selfparallel manner [2]. In this paper, we propose a simple algorithm for drawing the straight skeleton of a monotone polygon. The time and space complexities of our algorithm a ..."
Abstract
 Add to MetaCart
The straight skeleton of a simple polygon is defined as the trace of the vertices when the initial polygon is shrunken in selfparallel manner [2]. In this paper, we propose a simple algorithm for drawing the straight skeleton of a monotone polygon. The time and space complexities of our algorithm
Results 1  10
of
523