The problem of computing the convex hull of a nite set of points arises often in practice and is a cornerstone of any geometric software library. The 2-and 3-dimensional cases are of special interest due to their direct correspondence with physical entities. Several algorithms have been designed and developped for general dimension but also for this case. The aim of this work is to apply existi...

OFFIS and Politecnico di Milano. This document may be copied freely for use in the public domain. Sections of it may be copied provided that acknowledgement is given of this original work. No responsibility is assumed by the REQUEST Project or its members for application or design, nor for any infringements of patents or rights of others which may result from the use of this document. Preface—T...

O artigo investiga a fabulação artística e política de Aline Motta em A água é uma máquina do tempo (2022a). Apropriando-se materiais arquivo, sua linguagem se aproxima da “poesia por outros meios” (PERLOFF, 2013). Por outro lado, pesquisa sobre própria linhagem, que entrelaça com história das vidas negras no Brasil, aponta para horizontes invenção. Dialogando reflexões Leda Martins o espiralar...

We suggest a geometrical model for the distribution of luminous matter in the Universe, where the apparent dimension, D(l), increases linearly with the logarithm of the scale l. Beyond the correlation length, xi, the Universe is homogeneous, and D = 3. Comparison with data from the SARS redshift catalog, and the LEDA database provides a good fit with a correlation length xi approximately 300 Mp...

In Shih & Hsu [9] a simpler planarity test was introduced utilizing a data structure called PC-trees (generalized from PQ-trees). In this paper we give an efficient implementation of that linear time algorithm and illustrate in detail how to obtain a Kuratowski subgraph when the given graph is not planar, and how to obtain the embedding alongside the testing algorithm. We have implemented the a...

There are several numerical methods for computing approximate zeros of a given univariate polynomial. In this paper, we develop a simple and novel method for determining sharp upper bounds on errors in approximate zeros of a given polynomial using Rouche's theorem from complex analysis. We compute the error bounds using non-linear optimization. Our bounds are scalable in the sense that we compu...

Kurt Mehlhorn’s foundational results in computational geometry provide not only a basis for practical geometry systems such as Leda and CGAL, they also, in the spirit of Euclid, provide a sound basis for geometric truth. This article shows how Mehlhorn’s ideas from computational geometry have influenced work on the logical basis for constructive geometry. In particular there is a sketch of new ...

In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy evaluation scheme with the exact number types provided by LEDA allowing for efficient and exact computation with rational and algebraic geometric objects. It is the first kernel design which uses floating-point filter techni...

After the newly constructed LEDA outriggers at LWA1 became operational Hank Tillman and Steve Ellingson performed TBN observations on September 5, 2013. They only looked at the 5 outriggers and performed dipole-dipole correlations for those baselines. They noted discrepancies in the magnitude and phase of the correlation products going from baseline to baseline. More importantly they reported a...