On the shape parameter and constrained modification of GB-spline curves.
On the Zone of a Surface in a Hyperplane Arrangement.
Optimality of the Delaunay Triangulation in Rd .
Orthogonal drawings of plane graphs without bends.
Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes
One of the approaches in pattern recognition is the use of fractal geometry. The property of self-similarity of fractals has been used as a feature in several pattern recognition methods. All fractal recognition methods use global analysis of the shape. In this paper we present some drawbacks of these methods and propose fractal local analysis using partitioned iterated function systems with division. Moreover, we introduce a new fractal recognition method based on a dependence graph obtained from...
Partitioning Arrangements of Lines, I: An Efficient Deterministic Algorithm.
Partitioning Arrangements of Lines, II: Applications.
Piecewise Linear Paths Among Convex Obstacles.
Plane Bézier curves of third order: Some geometric reflections. (Ebene Bézierkurven 3. Ordnung: Einige geometrische Überlegungen.)
Points and Triangles in the Plane and Halving Planes in Space.
Polar coordinate drawing of planar graphs with good angular resolution.
Polar cylinders of surfaces of revolution: Contour line determination.
Polygon Triangulation in O(n log log n) Time with Simple Data Structures.
Properties of Conflict Sets in the Plane
This paper studies the smoothness and the curvature of conflict sets of the distance function in the plane. Conflict sets are also well known as 'bisectors'. We prove smoothness in the case of two convex sets and give a formula for the curvature. We generalize moreover to weighted distance functions, the so-called Johnson-Mehl model.
Pythagorův odkaz v geometrickém modelování
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping.
Ramsey partitions and proximity data structures
This paper addresses two problems lying at the intersection of geometric analysis and theoretical computer science: The non-linear isomorphic Dvoretzky theorem and the design of good approximate distance oracles for large distortion.We introduce the notion of Ramsey partitions of a finite metric space, and show that the existence of good Ramsey partitions implies a solution to the metric Ramsey problem for large distortion (also known as the non-linear version of the isomorphic Dvoretzky theorem,...
Range Searching with Efficient Hierarchical Cuttings.
Rational approximation of rotation minimizing frames using Pythagorean-hodograph cubics.
Real quartic surfaces containing 16 skew lines.