Can Visibility Graphs Be Represented Compactly?.
Castles in the Air Revisited.
Cohomología 3D y visualización.
Complex Fiber Visualization.
Computability and Complexity of Ray Tracing.
Computer aided design of mechatronic systems
Any successful company must react quickly to changing trends in the market. New products should be designed and manufactured quicker and cheaper than counter partners do. A shorter design time provides a distinct competitive advantage. The paper describes two approaches towards designing interdisciplinary mechatronic systems: the first is visual modelling with the UML, the second is physical modelling with Modelica.
Computerbilder von Aufblasungen.
Computing a Centerpoint of a Finite Planar Set of Points in Linear Time.
Computing the discrete compactness of orthogonal pseudo-polytopes via their D-EVM representation.
Computing the Volume, Counting Integral Points, and Exponential Sums.
Configuration spaces and limits of voronoi diagrams
The Voronoi diagram of n distinct generating points divides the plane into cells, each of which consists of points most close to one particular generator. After introducing 'limit Voronoi diagrams' by analyzing diagrams of moving and coinciding points, we define compactifications of the configuration space of n distinct, labeled points. On elements of these compactifications we define Voronoi diagrams.
Constructing Arrangements Optimally in Parallel.
Construction of e-Nets.
Constructive approximation of a ball by polytopes
Cooperatie guards in the fortress problem.
Counting Facets and Incidences.
Counting Triangle Crossings and Halving Planes.
Cubical approximation and computation of homology
The purpose of this article is to introduce a method for computing the homology groups of cellular complexes composed of cubes. We will pay attention to issues of storage and efficiency in performing computations on large complexes which will be required in applications to the computation of the Conley index. The algorithm used in the homology computations is based on a local reduction procedure, and we give a subquadratic estimate of its computational complexity. This estimate is rigorous in two...
Curvature computations on surfaces in -space
Cutting Hyperplane Arrangements.