@article{2535,
abstract = {We report the molecular characterization of two novel rat helix-loop-helix (HLH) proteins, designated HES-1 and HES-3, that show structural homology to the Drosophila hairy and Enhancer of split [E(spl)] proteins, both of which are required for normal neurogenesis. HES-1 mRNA, expressed in various tissues of both embryos and adults, is present at a high level in the epithelial cells, including the embryonal neuroepithelial cells, as well as in the mesoderm-derived tissues such as the embryonal muscle. In contrast, HES-3 mRNA is produced exclusively in cerebellar Purkinje cells. HES-1 represses transcription by binding to the N box, which is a recognition sequence of E(spl) proteins. Interestingly, neither HES-1 nor HES-3 alone interacts efficiently with the E box, but each protein decreases the transcription induced by E-box-binding HLH activators such as E47. Furthermore, HES-1 also inhibits the functions of MyoD and MASH1 and effectively diminishes the myogenic conversion of C3H10T1/2 cells induced by MyoD. These results suggest that HES-1 may play an important role in mammalian development by negatively acting on the two different sequences while HES-3 acts as a repressor in a specific type of neurons.},
author = {Sasai, Yoshiki and Kageyama, Ryoichiro and Tagawa, Yoshiaki and Ryuichi Shigemoto and Nakanishi, Shigetada},
journal = {Genes and Development},
number = {12 B},
pages = {2620 -- 2634},
publisher = {Cold Spring Harbor Laboratory Press},
title = {{Two mammalian helix-loop-helix factors structurally related to Drosophila hairy and Enhancer of split}},
doi = {10.1101/gad.6.12b.2620},
volume = {6},
year = {1992},
}
@article{4043,
abstract = {It is shown that a triangulation of a set of n points in the plane that minimizes the maximum angle can be computed in time O(n2 log n) and space O(n). The algorithm is fairly easy to implement and is based on the edge-insertion scheme that iteratively improves an arbitrary initial triangulation. It can be extended to the case where edges are prescribed, and, within the same time- and space-bounds, it can lexicographically minimize the sorted angle vector if the point set is in general position. Experimental results on the efficiency of the algorithm and the quality of the triangulations obtained are included.},
author = {Herbert Edelsbrunner and Tan, Tiow Seng and Waupotitsch, Roman},
journal = {SIAM Journal on Scientific Computing},
number = {4},
pages = {994 -- 1008},
publisher = {Society for Industrial and Applied Mathematics },
title = {{An O(n^2 log n) time algorithm for the MinMax angle triangulation}},
doi = {10.1137/0913058},
volume = {13},
year = {1992},
}
@article{4046,
abstract = {The main contribution of this work is an O(n log n + k)-time algorithm for computing all k intersections among n line segments in the plane. This time complexity is easily shown to be optimal. Within the same asymptotic cost, our algorithm can also construct the subdivision of the plane defined by the segments and compute which segment (if any) lies right above (or below) each intersection and each endpoint. The algorithm has been implemented and performs very well. The storage requirement is on the order of n + k in the worst case, but it is considerably lower in practice. To analyze the complexity of the algorithm, an amortization argument based on a new combinatorial theorem on line arrangements is used.},
author = {Chazelle, Bernard and Herbert Edelsbrunner},
journal = {Journal of the ACM},
number = {1},
pages = {1 -- 54},
publisher = {ACM},
title = {{An optimal algorithm for intersecting line segments in the plane}},
doi = {10.1145/147508.147511},
volume = {39},
year = {1992},
}
@article{4047,
abstract = {Arrangements of curves in the plane are fundamental to many problems in computational and combinatorial geometry (e.g. motion planning, algebraic cell decomposition, etc.). In this paper we study various topological and combinatorial properties of such arrangements under some mild assumptions on the shape of the curves, and develop basic tools for the construction, manipulation, and analysis of these arrangements. Our main results include a generalization of the zone theorem of Edelsbrunner (1986) and Chazelle (1985) to arrangements of curves (in which we show that the combinatorial complexity of the zone of a curve is nearly linear in the number of curves) and an application of that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements.},
author = {Herbert Edelsbrunner and Guibas, Leonidas and Pach, János and Pollack, Richard and Seidel, Raimund and Sharir, Micha},
journal = {Theoretical Computer Science},
number = {2},
pages = {319 -- 336},
publisher = {Elsevier},
title = {{Arrangements of curves in the plane - topology, combinatorics, and algorithms}},
doi = {10.1016/0304-3975(92)90319-B},
volume = {92},
year = {1992},
}
@article{4048,
abstract = {Given a sequence of n points that form the vertices of a simple polygon, we show that determining a closest pair requires OMEGA(n log n) time in the algebraic decision tree model. Together with the well-known O(n log n) upper bound for finding a closest pair, this settles an open problem of Lee and Preparata. We also extend this O(n log n) upper bound to the following problem: Given a collection of sets with a total of n points in the plane, find for each point a closest neighbor that does not belong to the same set.},
author = {Aggarwal, Alok and Herbert Edelsbrunner and Raghavan, Prabhakar and Tiwari, Prasoon},
journal = {Information Processing Letters},
number = {1},
pages = {55 -- 60},
publisher = {Elsevier},
title = {{Optimal time bounds for some proximity problems in the plane}},
doi = {10.1016/0020-0190(92)90133-G},
volume = {42},
year = {1992},
}