Computing convolutions by reciprocal search
SCG '86 Proceedings of the second annual symposium on Computational geometry
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
The Ultimate Planar Convex Hull Algorithm ?
The Ultimate Planar Convex Hull Algorithm ?
Computational geometry.
Geometric transforms for fast geometric algorithms
Geometric transforms for fast geometric algorithms
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
Multi-criteria geometric optimization problems in layered manufacturing
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Efficient approximation and optimization algorithms for computational metrology
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Incremental and decremental maintenance of planar width
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for projective clustering
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing the width of a three-dimensional point set: an experimental study
Journal of Experimental Algorithmics (JEA)
Computing Optimal Hatching Directions in Layered Manufacturing
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Approximation Algorithms for k-Line Center
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The visibility graph of congruent discs is Hamiltonian
Computational Geometry: Theory and Applications
Approximation algorithms for projective clustering
Journal of Algorithms
A (1 + ɛ)-approximation algorithm for 2-line-center
Computational Geometry: Theory and Applications
Incremental Penetration Depth Estimation between Convex Polytopes Using Dual-Space Expansion
IEEE Transactions on Visualization and Computer Graphics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A simple algorithm for digital line recognition in the general case
Pattern Recognition
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Locating Objects in the Plane Using Global Optimization Techniques
Mathematics of Operations Research
An enhanced convex-hull edge method for flatness tolerance evaluation
Computer-Aided Design
Locating an Obnoxious Line among Planar Objects
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient lattice width computation in arbitrary dimension
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Planar expropriation problem with non-rigid rectangular facilities
Computers and Operations Research
A geometric approach to the segmentation of range images
3DIM'99 Proceedings of the 2nd international conference on 3-D digital imaging and modeling
Fitting a two-joint orthogonal chain to a point set
Computational Geometry: Theory and Applications
Computing efficiently the lattice width in any dimension
Theoretical Computer Science
Depth buffer compression for stochastic motion blur rasterization
Proceedings of the ACM SIGGRAPH Symposium on High Performance Graphics
A linear algorithm for polygonal approximations of thick curves
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Recognition of blurred pieces of discrete planes
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
An elementary algorithm for digital line recognition in the general case
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
Optimal blurred segments decomposition in linear time
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The exact lattice width of planar sets and minimal arithmetical thickness
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Minimizing the error of linear separators on linearly inseparable data
Discrete Applied Mathematics
Computing an obnoxious anchored segment
Operations Research Letters
| Hi-index | 0.14 |
For a set of points P in three-dimensional space, the width of P, W (P), is defined as the minimum distance between parallel planes of support of P. It is shown that W(P) can be computed in O(n log n+I) time and O(n) space, where I is the number of antipodal pairs of edges of the convex hull of P, and n is the number of vertices; in the worst case, I=O(n/sup 2/). For a convex polyhedra the time complexity becomes O(n+I). If P is a set of points in the plane, the complexity can be reduced to O(nlog n). For simple polygons, linear time suffices.