Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a prototypical example. Implementations of such algorithms do, in general, not extend easily. For example, segment endpoints cause events in sweep line algorithms, but lines have no endpoints. We describe a gene...

A technique is presented for generating implicit sweep objects that support direct specification and manipulation of the surface with no topological limitations on the 2D sweep template. The novelty of this method is that the underlying scalar field is bounded and C continuous, apart from surface creases. Bounded scalar fields guarantee local influence when modeling with implicit surfaces, an i...

The sweep circle algorithm is based on the concept of wavefront developed by Dehne and Klein [Dehne, 1997]. In this case, because the sweep line is a site of the same nature as the sites being considered, we get an economy of scale for the objects to be treated. It uses the definition of a Voronoï diagram in projective geometry to simplify the treatment of the non-connected wavefront and vertex...

This work investigates the influence of using multiple views for 3D reconstruction with respect to depth accuracy and robustness. In particular we show that multiview matching not only contributes to scene completeness, but also improves depth accuracy by improved triangulation angles. We first start by synthetic experiments on a typical aerial photogrammetric camera network and investigate how...

We present an extensive experimental study comparing the performance of four algorithms for the following orthogonal segment intersection problem: given a set of horizontal and vertical line segments in the plane, report all intersecting horizontal-vertical pairs. The problem has important applications in VLSI layout and graphics, which are large-scale in nature. The algorithms under evaluation...

In this paper we present a novel technique to synthesize virtual camera viewpoints for soccer events. Our real-time video-based rendering technique does not require a precise estimation of the scene geometry. We initially segment the dynamic parts of the scene to consequently estimate a depth map of the filtered foreground regions using a plane sweep strategy. The depth map is indicatively segm...

This extended abstract gives an overview on two contentbased retrieval algorithms for symbolic music, developed earlier in the C-BRAHMS group [1], that took part in the Symbolic Melodic Similarity and Query by Singing/Humming tasks of the MIREX 2006 contest [3, 4]. Given two excerpts of symbolically encoded monophonic or polyphonic music, the query pattern and the target music, the purpose of t...

The paper introduces an algorithm dealing with polygons with non-stable borders. Such polygons may appear because of measuring errors or during scanning and vectorisation of blueprints. The aim of the algorithm is to remove these errors within prescribed tolerance. The algorithm uses a sweepline approach and works in two steps. In the first step, all non-stable areas are determined and in the s...

This paper describes the plane sweep algorithm for optimal use of tandem replicated data in a document. It is based on an observation that the original plane sweep algorithm is used to search in documents. Plane sweep algorithm does not feature a fast algorithm to find the word that is repeated in tandem in a document. With the help of effective parameters we could make a new technique to creat...