A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
Compliant motion in a simple polygon
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Structured visibility profiles with applications to problems in simple polygons (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Optimal link path queries in a simple polygon
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
An O(nlogn) implementation of the Douglas-Peucker algorithm for line simplification
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Approximating monotone polygonal curves using the uniform metric
Proceedings of the twelfth annual symposium on Computational geometry
An efficient algorithm for finding the CSG representation of a simple polygon
SIGGRAPH '88 Proceedings of the 15th annual conference on Computer graphics and interactive techniques
Finding Aggregate Proximity Relationships and Commonalities in Spatial Data Mining
IEEE Transactions on Knowledge and Data Engineering
Parallel Algorithms for Identification of Basis Polygons in an Image
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Information Processing and Management: an International Journal
Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach
Pattern Recognition Letters
The Erdős-Nagy theorem and its ramifications
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Modeling and Computing Ternary Projective Relations between Regions
IEEE Transactions on Knowledge and Data Engineering
Linear segmentation of discrete curves into blurred segments
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Three problems about simple polygons
Computational Geometry: Theory and Applications
A simple algorithm for digital line recognition in the general case
Pattern Recognition
Optimal simplification of polygonal chain for rendering
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Analysis of the rubberband algorithm
Image and Vision Computing
Efficient and consistent line simplification for web mapping
International Journal of Web Engineering and Technology
Optimal simplification of polygonal chains for subpixel-accurate rendering
Computational Geometry: Theory and Applications
Triangulating input-constrained planar point sets
Information Processing Letters
Lyndon + Christoffel = digitally convex
Pattern Recognition
Tangential cover for thick digital curves
Pattern Recognition
An Implicit Method for Interpolating Two Digital Closed Curves on Parallel Planes
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
Measure of circularity for parts of digital boundaries and its fast computation
Pattern Recognition
A linear algorithm for computing convex hulls for random lines
ACM Transactions on Algorithms (TALG)
Automatic computation of pebble roundness using digital imagery and discrete geometry
Computers & Geosciences
Parameter identification of 1D fractal interpolation functions using bounding volumes
Journal of Computational and Applied Mathematics
Three problems about simple polygons
Computational Geometry: Theory and Applications
The Erdős--Nagy theorem and its ramifications
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Linear segmentation of discrete curves into blurred segments
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
An approximate algorithm for solving the watchman route problem
RobVis'08 Proceedings of the 2nd international conference on Robot vision
Tangential cover for thick digital curves
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Robust decomposition of thick digital shapes
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Two linear-time algorithms for computing the minimum length polygon of a digital contour
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Extracting moving regions from spatial data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Recursive calculation of relative convex hulls
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Largest area convex hull of axis-aligned squares based on imprecise data
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Discrete Applied Mathematics
Classification using scale and rotation tolerant shape signatures from convex hulls
ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
A linear algorithm for polygonal approximations of thick curves
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Robust homography estimation from planar contours based on convexity
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
Face modeling using grid light and feature point extraction
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
k-sets of convex inclusion chains of planar point sets
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
Efficiently generating multiple representations for web mapping
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
Making polygons by simple folds and one straight cut
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Computational and structural advantages of circular boundary representation
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Direct multiple shooting method for solving approximate shortest path problems
Journal of Computational and Applied Mathematics
Recursive computation of minimum-length polygons
Computer Vision and Image Understanding
Covering paths for planar point sets
GD'12 Proceedings of the 20th international conference on Graph Drawing
Jigsaw: scalable software-defined caches
PACT '13 Proceedings of the 22nd international conference on Parallel architectures and compilation techniques
Triangulating and guarding realistic polygons
Computational Geometry: Theory and Applications
Quantifying upper-arm rehabilitation metrics for children through interaction with a humanoid Robot
Applied Bionics and Biomechanics - Human-Robot Interaction/Interface
| Hi-index | 0.89 |