Partitioning a polygonal region into trapezoids
Journal of the ACM (JACM)
Minimally covering a horizontally convex orthogonal polygon
SCG '86 Proceedings of the second annual symposium on Computational geometry
Triangulating a non-convex polytype
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Minimum K-partitioning of rectilinear polygons
Journal of Symbolic Computation
A single-exponential upper bound for finding shortest paths in three dimensions
Journal of the ACM (JACM)
Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Decomposing polygonal regions into convex quadrilaterals
SCG '85 Proceedings of the first annual symposium on Computational geometry
Triangulating Simple Polygons and Equivalent Problems
ACM Transactions on Graphics (TOG)
Slice and dice: a simple, improved approximate tiling recipe
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Approximate convex decomposition of polygons
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Technical Section: Point-in-polygon tests by convex decomposition
Computers and Graphics
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
International Journal of Computer Vision
Minimum weight convex Steiner partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A fixed parameter algorithm for optimal convex partitions
Journal of Discrete Algorithms
Digitization scheme that assures faithful reconstruction of plane figures
Pattern Recognition
Convex Partitions with 2-Edge Connected Dual Graphs
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Some theoretical challenges in digital geometry: A perspective
Discrete Applied Mathematics
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Scaling of plane figures that assures faithful digitization
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Articulation-invariant representation of non-planar shapes
ECCV'10 Proceedings of the 11th European conference on computer vision conference on Computer vision: Part III
ACCORD: with approximate covering of convex orthogonal decomposition
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Beyond triangulation: covering polygons with triangles
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Convex partitions with 2-edge connected dual graphs
Journal of Combinatorial Optimization
Approximation algorithms for the minimum convex partition problem
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A fixed parameter algorithm for the minimum number convex partition problem
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Polyhedrization of discrete convex volumes
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
IEEE/ACM Transactions on Networking (TON)
Approximate partitioning of 2D objects into orthogonally convex components
Computer Vision and Image Understanding
Hi-index | 0.00 |