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
Filter
  • Computational geometry  (2)
  • Aspergillus niger  (1)
  • Union of Spheres  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Algorithmica 1 (1986), S. 49-63 
    ISSN: 1432-0541
    Keywords: Computational geometry ; Computer graphics ; Robotics ; Visibility ; Hidden-line Elimination ; Visibility graph ; Shortest path
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consider a collection of disjoint polygons in the plane containing a total ofn edges. We show how to build, inO(n 2) time and space, a data structure from which inO(n) time we can compute the visibility polygon of a given point with respect to the polygon collection. As an application of this structure, the visibility graph of the given polygons can be constructed inO(n 2) time and space. This implies that the shortest path that connects two points in the plane and avoids the polygons in our collection can be computed inO(n 2) time, improving earlierO(n 2 logn) results.
    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
    Algorithmica 4 (1989), S. 77-96 
    ISSN: 1432-0541
    Keywords: Computational geometry ; Modified pruning technique ; LinearL 1 approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we present a linear-time algorithm for approximating a set ofn points by a linear function, or a line, that minimizes theL 1 norm. The algorithmic complexity of this problem appears not to have been investigated, although anO(n 3) naive algorithm can be easily obtained based on some simple characteristics of an optimumL 1 solution. Our linear-time algorithm is optimal within a constant factor and enables us to use linearL 1 approximation of many points in practice. The complexity ofL 1 linear approximation of a piecewise linear function is also touched upon.
    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 3 (1988), S. 323-328 
    ISSN: 1432-2315
    Keywords: Union of Spheres ; Volumes ; Laguerre Voronoid diagram ; Power diagram
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract OnO(n 2) exact algorithm is given for computing the volume of a set ofn spheres in space. The algorithm employs the Laguerre Voronoi (power) diagram and a method for computing the volume of the intersection of a simplex and a sphere exactly. We give a new proof of a special case of a conjecture, popularized by Klee, concerning the change in volume as the centres of the spheres become further apart.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Biotechnology and Bioengineering 56 (1997), S. 689-696 
    ISSN: 0006-3592
    Keywords: citric acid ; Aspergillus niger ; rotating disk contactor ; simulation ; biofilm ; Chemistry ; Biochemistry and Biotechnology
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Biology , Process Engineering, Biotechnology, Nutrition Technology
    Notes: A simple model was presented to describe the time courses of citric acid production by a rotating disc contactor (RDC) using Aspergillus niger. The model is expressed by Monod-type cell growth, Luedeking-Piret-type citric acid production rate equations, and the diffusion equation for oxygen in the biofilm. The model contains five parameters which were determined by the nonlinear least squares method by fitting the numerical solution to the experimental data. In solving the equations, the cell density of the biofilm was estimated from the value of cellular mass per unit of biofilm area using an empirical equation. The experimental time courses in citric acid production period were well simulated with this model. The relation between the specific biofilm surface area and the rate of citric acid production was also explained by the simulation using the average values of five parameters of twelve runs. © 1997 John Wiley & Sons, Inc. Biotechnol Bioeng 56: 689-696, 1997.
    Additional Material: 9 Ill.
    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...