Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 5 (1990), S. 289-304 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We address the problem of connecting line segments to form the boundary of a simple polygon—a simple circuit. However, not every set of segments can be so connected. We present anO(n logn)-time algorithm to determine whether a set of segments, constrained so that each segment has at least one endpoint on the boundary of the convex hull of the segments, admits a simple circuit. Furthermore, this technique can also be used to compute a simple circuit of minimum perimeter, or a simple circuit that bounds the minimum area, with no increase in computational complexity.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 4 (1989), S. 253-258 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We define Π(n) to be the largest number such that for every setP ofn points in the plane, there exist two pointsx, y ε P, where every circle containingx andy contains Π(n) points ofP. We establish lower and upper bounds for Π(n) and show that [n/27]+2≤Π(n)≤[n/4]+1. We define $$\bar \Pi (n)$$ for the special case where then points are restricted to be the vertices of a convex polygon. We show that $$\bar \Pi (n) = [n/3] + 1$$ .
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 10 (1994), S. 452-458 
    ISSN: 1432-2315
    Keywords: Computational geometry ; Algorithm ; Robot probe ; Identifying ; Robot finger
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract When robot finger probes are used to recognize objects,m-1 probes are necessary and sufficient to identify an object with a fixed orientation and position among a set ofm convex planarn-sided objects. An algorithm is presented to preprocess a set of objects for efficient probing, together with a probing scheme and algorithms to delete objects from or to insert objects into the set.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    The visual computer 2 (1986), S. 44-53 
    ISSN: 1432-2315
    Keywords: Nonnumerical Algorithms and Problems ; Geometrical problems and computations ; Computational Geometry ; Geometric algorithms ; Three-Dimensional Graphics and Realism ; Visible line/surface elimination
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A variety of applications have motivated interest in the hidden-line and hidden-surface problem. This has resulted in a number of fundamentally different solutions. However no algorithm has been shown to be optimal. A common trait among algorithms for hidden-line elimination is a worst case complexity ofO(n 2). It is the interent here to introduce an algorithm that exhibits a linear worst case complexity. The use of a restricted class of input, has been employed to achieve asymptotic improvement in complexity as well as simplifying the problem enough to permit theoretic analysis of the algorithm. The class of input is still general enough to conform to the requirements of a number of applications.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of statistical physics 11 (1974), S. 481-501 
    ISSN: 1572-9613
    Keywords: Transport ; plug flow ; multiphase ; tracer distribution ; residence time distribution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Physics
    Notes: Abstract A probabilistic model describing tracer transport in multiphase spatially inhomogeneous transport (plug-flow) systems is presented. The properties of the trajectories are completely described by a two-component Markov process with absorbing boundaries. The first component is continuous, the second discrete. Infinitesimal conditions are given. Probabilities associated with the process are derived.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    ISSN: 1534-4681
    Keywords: Sentinel node ; Mapping ; Merkel cell carcinoma
    Source: Springer Online Journal Archives 1860-2000
    Topics: Medicine
    Notes: Abstract Background: Merkel cell carcinoma (MCC) is an aggressive cutaneous tumor with a propensity for local recurrence, regional and distant metastases. There are no well-defined prognostic factors that predict behavior of this tumor, nor are treatment guidelines well established. Methods: Staging of patients with a new diagnosis of MCC was attempted using selective lymphadenectomy concurrent with primary excision. Preoperative and intraoperative mapping, excision, and thorough histologic evaluation of the first lymph node draining the tumor primary site [sentinel node] was performed. Patients with tumor metastasis in the sentinel node underwent complete resection of the remainder of the lymph node basin. Results: Twelve patients underwent removal of 22 sentinel nodes. Two patients demonstrated metastatic disease in their sentinel lymph nodes, and complete dissection of the involved nodal basin revealed additional positive nodes. The node-negative patients received no further surgical therapy, with no evidence of recurrent local or regional disease at a maximum of 26 months follow-up (median 10.5 months). Conclusions: While the data are preliminary and initial follow-up is limited, early results suggest that sentinel lymph node mapping and excision may be a useful adjunct in the treatment of MCC. This technique may identify a population of patients who would benefit from further surgical lymph node excision.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...