Add to ORKGWe define an edge-move operation for polygons and prove that every simple non-convex polygon P has a non-conflicting pair of complementary edge-moves that reduces the number of edges of P while preserving its area. We use this result to generate area-preserving C-oriented schematizations of polygons
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applicati...
Hand-drawn schematized maps traditionally make extensive use of curves. However, there are few autom...
We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the pl...
We define an edge-move operation for polygons and prove that every simple non-convex polygon P has a...
We define an edge-move operation for polygons and prove that every simple non-convex polygon P has a...
In this article, we study automated simplification and schematization of territorial outlines. We pr...
We describe an area-preserving subdivision schematization algorithm: the area of each region in the ...
For both the Fréchet distance and the symmetric difference, we show that finding the simple polygon ...
We introduce a local operation for polygons and subdivisions called an edge-move. Edge-moves do not ...
Hand-drawn schematized maps traditionally make extensive use of curves. However, there are few autom...
A common representation in 3-D computer vision is the polygonal surface mesh because meshes can mode...
Traditionally schematized maps make extensive use of curves. However, automated methods for schemati...
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applicati...
Hand-drawn schematized maps traditionally make extensive use of curves. However, there are few autom...
We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the pl...
We define an edge-move operation for polygons and prove that every simple non-convex polygon P has a...
We define an edge-move operation for polygons and prove that every simple non-convex polygon P has a...
In this article, we study automated simplification and schematization of territorial outlines. We pr...
We describe an area-preserving subdivision schematization algorithm: the area of each region in the ...
For both the Fréchet distance and the symmetric difference, we show that finding the simple polygon ...
We introduce a local operation for polygons and subdivisions called an edge-move. Edge-moves do not ...
Hand-drawn schematized maps traditionally make extensive use of curves. However, there are few autom...
A common representation in 3-D computer vision is the polygonal surface mesh because meshes can mode...
Traditionally schematized maps make extensive use of curves. However, automated methods for schemati...
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applicati...
Hand-drawn schematized maps traditionally make extensive use of curves. However, there are few autom...
We consider the family of lines that are area bisectors of a polygon (possibly with holes) in the pl...