 |
|
|
|
Aperture-Angle Optimization Problems in 3 Dimensions
Balanced partitions of two sets of points in the plane
Characterizing LR-Visibility Polygons and Related Problems
Coarse Grained Parallel Solution to Terrain Simplification, A
Computational Geometry on the Grid: Transversal and Planesweep Algorithms for Spatial Applications
Computational Investigations of the Optimality of Two- and Three-Dimensional Triangulations under Several Criteria
Constrained Facility Location
Constructing Median Constrained Minimum Spanning Tree
Convexifying Star-Shaped Polygons
Cutting Rectangles in equal area pieces
Detection of Text-Line Orientation
Dynamic Additively Weighted Voronoi diagrams made easy
Dynamic Maintenance and Visualization of Molecular Surfaces
Efficient Direct Approach for Computing Shortest Rectilinear Paths among Obstacles in a Two-Layer Interconnection Model, An
Euclidean Proximity and Power Diagrams
Exact Cost of Exploring Streets with a CAB, the
Finding Specified Sections of Arrangements: 2D Results
Framework for Memory-Efficient Levels of Detail, A
Geometric Clustering Models for Multimedia Databases
Geometric tree graphs of points in the plane
Guarding in a Simple Polygon
Hiding Disks in Folded Polygons
Hyperplane Depth and Nested Simplices
Illuminating Triangles and Quadrilaterals with Vertex Floodlights
Inapproximability of some art gallery problems
Intersecting general parametric surfaces using bounding volumes
Maintaining Partitions of Dynamic Planar Meshes
Modified Longest Side Bisection Triangulation, A
No Steiner Point Subdivision Simplification is NP-Complete
Note on Checking Proximity Graphs, A
On Reconfiguring Tree Linkages: Trees can Lock
On a disjoint quadrilateral partition for a given point set
On measuring areas of polygons
On Point Covers of c-Oriented Polygons
On the Multiple Label Placement Problem
On the Total Correctness of Lawson's Oriented Walk Algorithm
On the time bound for convex decomposition of simple polygons
Parallel edge flipping
Perfect Divisions of a Cake
Perspective Projections and Removal of Degeneracies
Planar sets with few empty convex polygons
Power Diagram Depth Sorting
Proximity Drawings of Binary Trees in Polynomial Area
Quantile Approximation for Robust Statistical Estimation
Recovering lines with fixed linear probes
Removing degeneracies by perturbing the problem or perturbing the world
Riemannian Computational Geometry: Voronoi Diagram and Delaunay-type Triangulation in Dually Flat Space
Separating objects in the plane with wedges and strips
Shortest paths and visibility inside triangulated curved polygons with applications to conic visibility
Shrinking-circle sweep-algorithm to construct the farthest site Delaunay diagram in the plane, A
Size of the Open Sphere of Influence Graph in L-[infinity] Metric Spaces, The
Some Problems on Approximation of Set of Points by Polygonal Curves
Straight-line embeddings of three rooted trees in the plane
Subexponential-time algorithms for minimum weight triangulations and related problems
Towards a Realistic Upper Bound for the Number of Facets of 3-dimensional Dirichlet Stereohedra
Towards a contour morphing preserving differentiability
Unfolding Some Classes of Orthogonal Polyhedra
