The following pages link to Hans-Dietrich Hecker (Q701798):
Displayed 50 items.
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Item:Q701798 (redirect page) (← links)
- Item:Q593685 (redirect page) (← links)
- On face vectors and vertex vectors of convex polyhedra (Q685585) (← links)
- Linear-time algorithms for weakly-monotone polygons (Q685601) (← links)
- One strike against the min-max degree triangulation problem (Q685602) (← links)
- Classes of discrete convexity properties (Q701799) (← links)
- Constructions and complexity of secondary polytopes (Q750909) (← links)
- Using Gale transforms in computational geometry (Q805285) (← links)
- Merging in maps and in pavings (Q809631) (← links)
- NP-harte Probleme für minimale Polygonüberdeckungen. (NP-hard problems for minimal polygon coverings) (Q811138) (← links)
- Zur schnellen Zerlegung von Polygonen in sternförmige Polygone. (On fast decomposition of polygons into star-shaped polygons) (Q811139) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Über das Kotziggewicht normaler Pflasterungen. (About the Kotzig weight of normal tilings.) (Q923091) (← links)
- A tight lower bound on the size of visibility graphs (Q1098639) (← links)
- Item:Q701798 (redirect page) (← links)
- Parallel computational geometry (Q1115600) (← links)
- A simple linear-time algorithm for computing the ring and MST of unimodal polygons (Q1120279) (← links)
- Hiding people in polygons (Q1122366) (← links)
- A hierarchy of simple polygons. (Q1177848) (← links)
- Continuity of the visibility function (Q1182625) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Counting facets and incidences (Q1189286) (← links)
- The maximum number of second smallest distances in finite planar sets (Q1189287) (← links)
- On the convexification procedure for nonconvex and nonsmooth infinite dimensional optimization problems (Q1190317) (← links)
- Walking an unknown street with bounded detour (Q1194307) (← links)
- Hidden surface removal for \(c\)-oriented polyhedra (Q1194308) (← links)
- Minimum dissection of a rectilinear polygon with arbitrary holes into rectangles (Q1196367) (← links)
- Nonoverlap of the star unfolding (Q1199127) (← links)
- Further NP-hard problems for minimal polygon coverings (Q1200939) (← links)
- Line-star-shapedness -- a further generalization of star-shapedness (Q1200946) (← links)
- Some geometric aspects of image processing (Q1200972) (← links)
- On the computational geometry of pocket machining (Q1202051) (← links)
- The furthest-site geodesic Voronoi diagram (Q1207795) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Model-based probing strategies for convex polygons (Q1208433) (← links)
- An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
- Algorithmen zur Unimodalitätsbestimmung einfacher Polygone. (Algorithms for determination of unimodality of simple polygons) (Q1263963) (← links)
- The Schur-Cohn algorithm revisited (Q1269745) (← links)
- Specification and simulation of statistical query algorithms for efficiency and noise tolerance (Q1271551) (← links)
- An optimal convex hull algorithm in any fixed dimension (Q1312190) (← links)
- On the complexity of a single cell in certain arrangements of surfaces related to motion planning (Q1314439) (← links)
- Chirality and the isotopy classification of skew lines in projective 3- space (Q1319276) (← links)
- The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes (Q1323968) (← links)
- Camera placement in integer lattices (Q1330888) (← links)
- Two segment classes with Hamiltonian visibility graphs (Q1334612) (← links)
- On the number of views of polyhedral terrains (Q1334930) (← links)
- Complexity theory. Limits of the efficiency of algorithms (Q1395898) (← links)
- An invitation to 3-D vision. From images to geometric models. (Q1418773) (← links)
- On simplifying dot maps. (Q1421029) (← links)