Results 1  10
of
641
Circle Segments: A Technique for Visually Exploring Large Multidimensional Data Sets
, 1996
"... In this paper, we describe a novel technique for visualizing large amounts of highdimensional data, called ‘circle segments’. The technique uses one colored pixel per data value and can therefore be classified as a pixelpervalue technique [Kei 96]. The basic idea of the ‘circle segments ’ visuali ..."
Abstract

Cited by 80 (8 self)
 Add to MetaCart
In this paper, we describe a novel technique for visualizing large amounts of highdimensional data, called ‘circle segments’. The technique uses one colored pixel per data value and can therefore be classified as a pixelpervalue technique [Kei 96]. The basic idea of the ‘circle segments
The CircleSegmentView  A Visualization for Query Preview and Visual Filtering
, 2005
"... Users of Information Retrieval systems have often been the target group of HumanComputer Interaction researchers. A lot of e#ort has been spent inventing new forms of visualizations to support the information seeking process. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Users of Information Retrieval systems have often been the target group of HumanComputer Interaction researchers. A lot of e#ort has been spent inventing new forms of visualizations to support the information seeking process.
Use of CircleSegments as a Data Visualization Technique for Feature Selection in Pattern Classification
"... Abstract. One of the issues associated with pattern classification using databased machine learning systems is the “curse of dimensionality”. In this paper, the circlesegments method is proposed as a feature selection method to identify important input features before the entire data set is provid ..."
Abstract
 Add to MetaCart
Abstract. One of the issues associated with pattern classification using databased machine learning systems is the “curse of dimensionality”. In this paper, the circlesegments method is proposed as a feature selection method to identify important input features before the entire data set
Use of the CircleSegments Method as a Data Visualization Tool for an Artificial Neural Network
"... Process modeling and prediction is one of the major tasks in many industrial applications. The MultiLayered Perceptron (MLP) neural network has been a popular approach in process modeling and prediction, and has produced good results. One of the disadvantages of the MLP is that it is unable to prov ..."
Abstract
 Add to MetaCart
to provide a visualization effect of the underlying relationships between the input and output data. In this paper, we propose to use the circlesegments method as a visualization tool for the MLP. The applicability of the hybrid MLP and circlesegments approach is demonstrated using a case study on a closed
Optimal paths for a car that goes both forwards and backwards
 PACIFIC JOURNAL OF MATHEMATICS
, 1990
"... The path taken by a car with a given minimum turning radius has a lower bound on its radius of curvature at each point, but the path has cusps if the car shifts into or out of reverse gear. What is the shortest such path a car can travel between two points if its starting and ending directions are s ..."
Abstract

Cited by 279 (0 self)
 Add to MetaCart
give these paths by explicit formula. Calculating the length of each of these paths and selecting the (not necessarily unique) path with smallest length yields a simple algorithm for a shortest path in each case. These optimal paths or geodesies may be described as follows: If C is an arc of a circle
www.elsevier.com/locate/cagd Rational quadratic circles are parametrized by chord length
, 2006
"... We show that the chord length parameter assignment is exact for circle segments in standard rational quadratic form. ..."
Abstract
 Add to MetaCart
We show that the chord length parameter assignment is exact for circle segments in standard rational quadratic form.
Cutting Circles into Pseudosegments and Improved Bounds for Incidences
 Geom
, 2000
"... We show that n arbitrary circles in the plane can be cut into O(n 3/2+# ) arcs, for any # > 0, such that any pair of arcs intersect at most once. This improves a recent result of Tamaki and Tokuyama [20]. We use this result to obtain improved upper bounds on the number of incidences between m ..."
Abstract

Cited by 34 (14 self)
 Add to MetaCart
We show that n arbitrary circles in the plane can be cut into O(n 3/2+# ) arcs, for any # > 0, such that any pair of arcs intersect at most once. This improves a recent result of Tamaki and Tokuyama [20]. We use this result to obtain improved upper bounds on the number of incidences between m
On the complexity of many faces in arrangements of pseudosegments and of circles
 IN DISCRETE AND COMPUTATIONAL GEOMETRY: THE GOODMANPOLLACK FESTSCHRIFT
"... We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudosegments, n circles, or n unit circles. The bounds are worstcase optimal for unit circles; they are also worstcase optimal for the case of pseudosegments, except when the number of faces is very small, i ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n pseudosegments, n circles, or n unit circles. The bounds are worstcase optimal for unit circles; they are also worstcase optimal for the case of pseudosegments, except when the number of faces is very small
Computing Largest Circles Separating Two Sets of Segments
, 1996
"... A circle C separates two planar sets if it encloses one of the sets and its open interior disk does not meet the other set. A separating circle is a largest one if it cannot be locally increased while still separating the two given sets. An \Theta(n log n) optimal algorithm is proposed to find all l ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
largest circles separating two given sets of line segments when line segments are allowed to meet only at their endpoints. In the general case, when line segments may intersect\Omega\Gamma n 2 ) times, our algorithm can be adapted to work in O(nff(n) log n) time and O(nff(n)) space, where ff(n) represents
Results 1  10
of
641