Results 1  10
of
2,778
Automatic searching for Fenucleus vertex points in balloon emulsion experiment RUNJOB
"... Abstract In 6 out of the 10 successful balloon flights in the RUNJOB experiment emulsion chambers comprised screentype Xray films (SXF). A new method has been developed, that allows selecting tracks produced by heavy nuclei with a wide microscope stage driven by stepping motors and optics interfa ..."
Abstract
 Add to MetaCart
interfaced to a PC. In this paper we show the second step of the experimental procedure: tracing up nucleus tracks in emulsion layers, searching for and review of the interaction vertex points originated by heavy nuclei. The results and the analysis are presented in this work. It gives an opportunity
ReTiling Polygonal Surfaces
 Computer Graphics
, 1992
"... This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object. Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speed ..."
Abstract

Cited by 445 (3 self)
 Add to MetaCart
model and the new points that are to become vertices in the retiled surface. The new model is then created by removing each original vertex and locally retriangulating the surface in a way that matches the local connectedness of the initial surface. This technique for surface retessellation has been
An Algorithm for Planning CollisionFree Paths Among Polyhedral Obstacles
, 1979
"... This paper describes a collision avoidance algorithm for planning a safe path for a polyhedral object moving among known polyhedral objects. The algorithm transforms the obstacles so that they represent the locus of forbidden positions for an arbitrary reference point on the moving object. A traject ..."
Abstract

Cited by 404 (3 self)
 Add to MetaCart
trajectory of this reference point which avoids all forbidden regions is free of collisions. Trajectories are found by searching a network which indicates, for each vertex in the transformed obstacles, which other vertices can be reached safely.
Surface Reconstruction by Voronoi Filtering
 Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract

Cited by 405 (11 self)
 Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewiselinear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
Retiming Synchronous Circuitry
 ALGORITHMICA
, 1991
"... This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous circui ..."
Abstract

Cited by 376 (3 self)
 Add to MetaCart
This paper describes a circuit transformation called retiming in which registers are added at some points in a circuit and removed from others in such a way that the functional behavior of the circuit as a whole is preserved. We show that retiming can be used to transform a given synchronous
A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra
, 1990
"... We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following prope ..."
Abstract

Cited by 223 (29 self)
 Add to MetaCart
We present a new piv otbased algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following
A Computational Approach for Corner and Vertex Detection
 International Journal of Computer Vision
, 1992
"... Corners and vertices are strong and useful features in Computer Vision for scene analysis, stereo matching and motion analysis. This paper deals with the development of a computational approach to these important features. We consider first a corner model and study analytically its behavior once it ..."
Abstract

Cited by 132 (1 self)
 Add to MetaCart
it has been smoothed using the wellknown Gaussian filter. This allows us to clarify the behavior of some well known cornerness measure based approaches used to detect these points of interest. Most of these classical approaches appear to detect points that do not correspond to the exact position
The tropical vertex
"... Abstract. Elements of the tropical vertex group are formal families of symplectomorphisms of the 2dimensional algebraic torus. We prove ordered product factorizations in the tropical vertex group are equivalent to calculations of certain genus 0 relative GromovWitten invariants of toric surfaces. ..."
Abstract

Cited by 33 (10 self)
 Add to MetaCart
Abstract. Elements of the tropical vertex group are formal families of symplectomorphisms of the 2dimensional algebraic torus. We prove ordered product factorizations in the tropical vertex group are equivalent to calculations of certain genus 0 relative GromovWitten invariants of toric surfaces
Stability of Vertex Fixed Points and Applications
 Foundations of Genetic Algorithms 3
, 1995
"... In the Infinite Population Simple Genetic Algorithm, stability of fixed points is considered when mutation is zero. The analysis is based on the spectrum of the di#erential of the mapping which defines the transition from one generation to the next. Based on a simple formula for this spectrum, fully ..."
Abstract

Cited by 19 (7 self)
 Add to MetaCart
In the Infinite Population Simple Genetic Algorithm, stability of fixed points is considered when mutation is zero. The analysis is based on the spectrum of the di#erential of the mapping which defines the transition from one generation to the next. Based on a simple formula for this spectrum
Perestroikas of vertex sets at umbilic points
, 2008
"... Mark all vertices on a curve evolving under a family of curves obtained by intersecting a smooth surface M with the 1parameter family of planes parallel to the tangent plane of M at a point p. Those vertices trace out a set, called the vertex set through p. We take p to be a generic umbilic point o ..."
Abstract
 Add to MetaCart
Mark all vertices on a curve evolving under a family of curves obtained by intersecting a smooth surface M with the 1parameter family of planes parallel to the tangent plane of M at a point p. Those vertices trace out a set, called the vertex set through p. We take p to be a generic umbilic point
Results 1  10
of
2,778