Results 11  20
of
639
Using Polyballs to Approximate Shapes and Skeletons
 In 12 th ICPR
, 1994
"... This paper presents an approach to approximate the skeleton of continuous shapes either in 2D or 3D space. The data required is a sampling of the boundary of the shape. We call polyball any finite union of balls. A preliminary work on polyballs shows that their skeletons consist of simple component ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
components (line segments in 2D and polygons in 3D). To construct these components, only the computation of a Voronoi graph is required. Recent papers have proposed to approximate the skeleton of continuous shapes using the Voronoi graph of boundary points. An original reformulation of these methods
A library of constructive skeletons for sequential style of parallel programming
 In InfoScale ’06: Proceedings of the 1st international conference on Scalable information systems, volume 152 of ACM International Conference Proceeding Series
, 2006
"... With the increasing popularity of parallel programming environments such as PC clusters, more and more sequential programmers, with little knowledge about parallel architectures and parallel programming, are hoping to write parallel programs. Numerous attempts have been made to develop highlevel pa ..."
Abstract

Cited by 28 (8 self)
 Add to MetaCart
applications of a skeleton library SkeTo. The SkeTo library is unique in its feature that it has a solid theoretical foundation based on the theory of Constructive Algorithmics, and is practical to be used to describe various parallel computations in a sequential manner. 1.
Performance Prediction with Skeletons
"... The performance skeleton of an application is a short running program whose performance in any scenario reflects the performance of the application it represents. Specifically, the execution time of the performance skeleton is a small fixed fraction of the execution time of the corresponding applica ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
application in any execution environment. Such a skeleton can be employed to quickly estimate the performance of a large application under existing network and node sharing. This paper presents a framework for automatic construction of performance skeletons of a specified execution time and evaluates
Straight Skeletons for General Polygonal Figures in the Plane
, 1996
"... : A novel type of skeleton for general polygonal figures, the straight skeleton S(G) of a planar straight line graph G, is introduced and discussed. Exact bounds on the size of S(G) are derived. The straight line structure of S(G) and its lower combinatorial complexity may make S(G) preferable to th ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
to the widely used Voronoi diagram (or medial axis) of G in several applications. We explain why S(G) has no Voronoi diagram based interpretation and why standard construction techniques fail to work. A simple O(n) space algorithm for constructing S(G) is proposed. The worstcase running time is O(n 3 log n
Designing a Scalable Cross Platform Imposed Code Reuse Framework,” Microsoft eScience Workshop in
, 2010
"... In order to construct a file format conversion service supporting as many formats as possible we have introduced the notion of imposed code reuse in our past work (McHenry et al. [24]). Traditional code reuse, when an option, can save a significant amount of energy and time with regards to new soft ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
to wrap GUI based applications on the Windows operating system. AutoHotKey, a GUI scripting language, takes advantage of the message passing system within Windows. Using tools such as Winspector Spy2 1 and AutoIt3
HamiltonJacobi Skeleton on Cortical Surfaces
, 2007
"... In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In our approach, a cortical surface is first partitioned into sulcal and gyral regions via the solution of a variational problem using ..."
Abstract

Cited by 9 (3 self)
 Add to MetaCart
In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In our approach, a cortical surface is first partitioned into sulcal and gyral regions via the solution of a variational problem using
Program Development for Computational Grids Using Skeletons and Peformance Prediction
 Letters
, 2002
"... We address the challenging problem of algorithm and program design for the Computational Grid by providing the application user with a set of highlevel, parameterized components called skeletons. We describe a Javabased Grid programming system in which algorithms are composed of skeletons and t ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
performance for Grid applications constructed using skeletons.
Skeletons and Transformations in an Integrated Parallel Programming Environment
, 1999
"... . We sketch an integrated environment for the systematic development of parallel and distributed programs. Our approach allows the user to construct complex applications by composing and transforming skeletons, i.e., recurring patterns of task and data parallelism. First academic and commercial ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
. We sketch an integrated environment for the systematic development of parallel and distributed programs. Our approach allows the user to construct complex applications by composing and transforming skeletons, i.e., recurring patterns of task and data parallelism. First academic
Approximating a Motorcycle Graph by a Straight Skeleton
"... We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straightline graph G such that the straight skeleton of G reveals the motorcycle graph of M, for every given finite set M of motorcycles. An application of our construction is ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate how a straight skeleton can be used to approximate a motorcycle graph. We explain how to construct a planar straightline graph G such that the straight skeleton of G reveals the motorcycle graph of M, for every given finite set M of motorcycles. An application of our construction
A Survey of Cost Models for Algorithmic Skeletons
, 1999
"... This report presents a survey of performance models for parallel algorithmic skeletons. First, higherorder functions (HOFs) are presented according to the modelled skeletons. Next, the corresponding parallel implementations (skeletons) for the HOFs are discussed with the performance models that wer ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
that were constructed for the skeletons. 1 Introduction Effective portability depends crucially on the predictability of performance. Therefore, accurate performance models are required to predict the behaviour of a given skeleton before successfully porting the application that is currently using
Results 11  20
of
639