Planar separators and parallel polygon triangulation (preliminary version)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal parallel algorithms for triangulated simple polygons
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Generalized hidden surface removal
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Area optimization of simple polygons
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An optimal algorithm for the two-guard problem
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On point location and motion planning among simplices
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Overlaying simply connected planar subdivisions in linear time
Proceedings of the eleventh annual symposium on Computational geometry
Efficient decomposition of polygons into L-shapes with application to VLSI layouts
ACM Transactions on Design Automation of Electronic Systems (TODAES)
On triangulating three-dimensional polygons
Proceedings of the twelfth annual symposium on Computational geometry
The power of coherence: fast tessellation of surfaces
Proceedings of the twelfth annual symposium on Computational geometry
Folding a simple polygon: a paradigm for computational geometry
CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
Constructing approximate shortest path maps in three dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
A pedestrian approach to ray shooting: shoot a ray, take a walk
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Classical floorplanning harmful?
ISPD '00 Proceedings of the 2000 international symposium on Physical design
On the continuous Weber and k-median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
Linear-time triangulation of a simple polygon made easier via randomization
Proceedings of the sixteenth annual symposium on Computational geometry
Optimal covering tours with turn costs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
ACM SIGACT News
An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
Information Processing Letters
Lower bounds for approximate polygon decomposition and minimum gap
Information Processing Letters
Optimally computing a shortest weakly visible line segment inside a simple polygon
Computational Geometry: Theory and Applications
Finding all weakly-visible chords of a polygon in linear time
Nordic Journal of Computing
A Linear Time Heuristics for Trapezoidation of GIS Polygons
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Adaptive Algorithms for Constructing Convex Hulls and Triangulations of Polygonal Chains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Optimal Polygon Cover Problems and Applcations
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Upward Planarity Checking: ``Faces Are More than Polygons''
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Splitting a Delaunay Triangulation in Linear Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Translating a convex polyhedron over monotone polyhedra
Computational Geometry: Theory and Applications
Good NEWS: partitioning a simple polygon by compass directions
Proceedings of the nineteenth annual symposium on Computational geometry
Finding shortest safari routes in simple polygons
Information Processing Letters
An approximative solution to the Zookeeper's Problem
Information Processing Letters
Approximation algorithms for the watchman route and zookeeper's problems
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Point containment in the integer hull of a polyhedron
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Expected asymptotically optimal planar point location
Computational Geometry: Theory and Applications - Special issue on the 10th fall workshop on computational geometry
An almost linear-time algorithm for trapezoidation of GIS polygons
Future Generation Computer Systems - Special issue: Geocomputation
The geometry of carpentry and joinery
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Finding large sticks and potatoes in polygons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Computing the Fréchet distance between simple polygons in polynomial time
Proceedings of the twenty-second annual symposium on Computational geometry
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Computer Vision and Image Understanding
3D model metrieval based on volumetric extended gaussian image and hierarchical self organizing map
MULTIMEDIA '06 Proceedings of the 14th annual ACM international conference on Multimedia
Three problems about simple polygons
Computational Geometry: Theory and Applications
A 2-approximation algorithm for the zookeeper's problem
Information Processing Letters
Guard placement for efficient point-in-polygon proofs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Constructing pairwise disjoint paths with few links
ACM Transactions on Algorithms (TALG)
Minimum weight pseudo-triangulations
Computational Geometry: Theory and Applications
Delaunay triangulations of imprecise pointsin linear time after preprocessing
Proceedings of the twenty-fourth annual symposium on Computational geometry
SIGITE '08 Proceedings of the 9th ACM SIGITE conference on Information technology education
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Smooth Linear Approximation of Non-overlap Constraints
Diagrams '08 Proceedings of the 5th international conference on Diagrammatic Representation and Inference
Studying (non-planar) road networks through an algorithmic lens
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Towards a definition of higher order constrained Delaunay triangulations
Computational Geometry: Theory and Applications
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Algorithms for Computing Diffuse Reflection Paths in Polygons
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Generating All Triangulations of Plane Graphs (Extended Abstract)
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
International Journal of Robotics Research
Guarding curvilinear art galleries with vertex or point guards
Computational Geometry: Theory and Applications
A Cost-Optimal Algorithm for Guard Zone Problem
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Distributed vision with smart pixels
Proceedings of the twenty-fifth annual symposium on Computational geometry
Decompositions and boundary coverings of non-convex fat polyhedra
Computational Geometry: Theory and Applications
Delaunay Triangulation of Imprecise Points Simplified and Extended
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Delaunay triangulation of imprecise points in linear time after preprocessing
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications - Special issue on the Japan conference on discrete and computational geometry 2004
Three problems about simple polygons
Computational Geometry: Theory and Applications
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
Robust uniform triangulation algorithm for computer aided design
Computer-Aided Design
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Angle and distance constraints on tree drawings
GD'06 Proceedings of the 14th international conference on Graph drawing
Partitioning polygons into tree monotone and y-monotone subpolygons
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Euclidean shortest paths in simple cube curves at a glance
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Decomposing a simple polygon into trapezoids
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Grasping Non-stretchable Cloth Polygons
International Journal of Robotics Research
Optimal triangulation with Steiner points
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning
Journal of Artificial Intelligence Research
Proceedings of the twenty-seventh annual symposium on Computational geometry
Beyond triangulation: covering polygons with triangles
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
A nearly optimal algorithm for finding L1shortest paths among polygonal obstacles in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
An optimal algorithm for the 1-searchability of polygonal rooms
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Shortest non-crossing walks in the plane
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Persistent predecessor search and orthogonal point location on the word RAM
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms (TALG)
Finding the shortest path between two points in a simple polygon by applying a rubberband algorithm
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
Constant-Work-Space algorithm for a shortest path in a simple polygon
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Shortest path problem in rectangular complexes of global nonpositive curvature
Computational Geometry: Theory and Applications
Non-crossing matchings of points with geometric objects
Computational Geometry: Theory and Applications
Computing the visibility polygon of an island in a polygonal domain
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Optimal uniformly monotone partitioning of polygons with holes
Computer-Aided Design
Viewpoint quality and scene understanding
VAST'05 Proceedings of the 6th International conference on Virtual Reality, Archaeology and Intelligent Cultural Heritage
Dividing a Territory Among Several Vehicles
INFORMS Journal on Computing
Covering paths for planar point sets
GD'12 Proceedings of the 20th international conference on Graph Drawing
Discrete Applied Mathematics
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Weak visibility polygons of NURBS curves inside simple polygons
Journal of Computational and Applied Mathematics
Distance-Sensitive planar point location
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Beacon-Based algorithms for geometric routing
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Triangulating and guarding realistic polygons
Computational Geometry: Theory and Applications
Offset polygon and annulus placement problems
Computational Geometry: Theory and Applications
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry: Theory and Applications
An algorithm for triangulating multiple 3D polygons
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
| Hi-index | 0.00 |