873 research outputs found
Binary plane partitions with cells of bounded complexity
Get PDFAbstract Binary Plane Partitions with Cells of Bounded Complexity by Henrik Sarkssian A binary plane partition (BPP) for a set of disjoint line segments in Euclidean plane is a simple hierarchical decomposition of a convex cell in the plane into convex faces by partitioning along lines. Given a finite set of disjoint segments in a convex cell in R2, a BPP partitions the plane (and some of the line segments) along a line and recurses on the segments left or clipped in each of the regions created after partitioning. The generalization of BPP to higher dimensions is binary space partition (BSP) in which we are given disjoint objects in a convex cell, and we recursively partition this cell by hyper planes. The size of BSP is defined to be the number of fragments that the input objects are partitioned into.We show that to prove an asymptotic upper bound for the size of BSP, one can investigate equivalently the number of regions generated by partitioning or one can instead count the number of events where a segment is cut. Based on previous work by Dr. Csaba Toth it is known that a convex cell with n disjoint segments inside the cell admits a BSP of size O(nlnn/lnlnn), and this bound is the best possible [1,2]. In this thesis we investigate BSPs with the additional restriction that all cells have constant description complexity; typically these cells will be vertical trapezoid.Includes bibliographical references (pages 41-41)California State University, Northridge. Department of Mathematics
Henri Temianka Correspondence; (toth)
Get PDFThis collection contains material pertaining to the life, career, and activities of Henri Temianka, violin virtuoso, conductor, music teacher, and author. Materials include correspondence, concert programs and flyers, music scores, photographs, and books.https://digitalcommons.chapman.edu/temianka_correspondence/4215/thumbnail.jp
On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance
Get PDFWe revisit the classical polygonal line simplification problem and study it using the Hausdorff distance and Fréchet distance. Interestingly, no previous authors studied line simplification under these measures in its pure form, namely: for a given epsilon>0, choose a minimum size subsequence of the vertices of the input such that the Hausdorff or Fréchet distance between the input and output polylines is at most epsilon. We analyze how the well-known Douglas-Peucker and Imai-Iri simplification algorithms perform compared to the optimum possible, also in the situation where the algorithms are given a considerably larger error threshold than epsilon. Furthermore, we show that computing an optimal simplification using the undirected Hausdorff distance is NP-hard. The same holds when using the directed Hausdorff distance from the input to the output polyline, whereas the reverse can be computed in polynomial time. Finally, to compute the optimal simplification from a polygonal line consisting of n vertices under the Fréchet distance, we give an O(kn^5) time algorithm that requires O(kn^2) space, where k is the output complexity of the simplification
Alex Toth and another Librarian examining a card catalog
No full textAlex Toth, who was a Librarian at Pacific University, and another Librarian (possibly Patricia Sobottka?), examining a card catalog in Pacific's Scott Library in July, 1978. This appears to be the Author catalog, which provided access to the books in Pacific's collections based on the last name of the author. This is one of a set of photographs that appears to have been posed in order to demonstrate the range of work that was taking place in the library
Effectiveness of hypnosis for pain management in colorectal surgery: project proposal for a systematic review
No full textThis work is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 4.0 International License.
General rights
All content in PEARL is protected by copyright law. Author manuscripts are made available in accordance with publisher
policies. Please cite only the published version using the details provided on the item record or document. In the absence of an
open licence (e.g. Creative Commons), permissions for further reuse of content should be sought from the publisher or author
Check list of the Hungarian Salticidae with biogeographical notes
No full textAn updated check list of the Hungarian jumping spider fauna is presented. 70, species are recorded from Hungary so far. Four species are new to the Hungarian fauna: Hasarius adansoni, Neon valentulus, Sitticus caricis, Synageles subcingulatus. With 12 original drawings
Summary Report Of Working Group 8: Laser Technology For Laser-Plasma Accelerators
Get PDFLaser Technology has long been the limiting and the enabling step for laser plasma accelerators. The work presented here addressed the current and near future laser technology relevant to particle acceleration as well as laser technology challenges for future accelerator facilities. Many laser facilities are operating or will be operating shortly at high intensity, high peak power, and with good beam parameters.Physic
The Autonarratives of Ernest Hemingway (and Others)
No full textDraws on the theories of Kenneth Burke, Julia Kristeva, and others in his examination of the complexity of self-representation found in A Moveable Feast. Toth analyzes Hemingway’s fictional construction of personal experience in “Miss Stein Instructs,” “Ford Madox Ford and the Devil’s Disciple,” “Birth of a New School,” and elsewhere. Concludes that the discreet sketches “emerge as a series of accurate yet always also contingent portraits—of Hemingway as a young author, of other famous writers working in the same place and time, of the specific events that defined the function of writing during the ‘Paris movement.’
On the Upward Planarity of Mixed Plane Graphs
Get PDFA mixed plane graph is a plane graph whose edge set is partitioned into a set of directed edges and a set of undirected edges. An orientation of a mixed plane graph G is an assignment of directions to the undirected edges of G resulting in a directed plane graph TeX . In this paper, we study the computational complexity of testing whether a given mixed plane graph G is upward planar, i.e., whether it admits an orientation resulting in a directed plane graph G such that G admits a planar drawing in which each edge is represented by a curve monotonically increasing in the y-direction according to its orientation.
Our contribution is threefold. First, we show that the upward planarity testing problem is solvable in cubic time for mixed outerplane graphs. Second, we show that the problem of testing the upward planarity of mixed plane graphs reduces in quadratic time to the problem of testing the upward planarity of mixed plane triangulations. Third, we exhibit linear-time testing algorithms for two classes of mixed plane triangulations, namely mixed plane 3-trees and mixed plane triangulations in which the undirected edges induce a forest
- …
