COMPUTER GRAPHICS forum Visualizing Objects with Mirrors (2009)
F. Hurtado, M. Noy, V. Sacristán, S. Skiena
We present an automatic camera and mirrors placement method for visualizing 3D scenes such that complete and nonredundant visibility is guaranteed, as well as highest image resolution. We provide...
Performance studies of the CMS Strip Tracker before installation (2009)
Adam, W, Bergauer, T, Dragicevic, M, Friedl, M, Frühwirth, R, Hansel, S, ...
In March 2007 the assembly of the Silicon Strip Tracker was completed at the Tracker Integration Facility at CERN. Nearly 15% of the detector was instrumented using cables, fiber optics, power...
A digital ECAL based on MAPS (2009)
Ballin, J. A., Dauncey, P. D., Noy, M., Mikami, Y., Miller, O., ...
Progress is reported on the development and testing of Monolithic Active Pixel Sensors (MAPS) for a Si-W ECAL for the ILC. Using laser and source setups, a first version of the sensor has been...
Geometric Tree Graphs of Points in Convex Position (2008)
M. C. Hern, F. Hurtado, A. Marquez, M. Mora, M. Noy, ...
Given a set P of points in the plane, the geometric tree graph of P is de ned as the graph T (P) whose vertices are non-crossing rectilinear spanning trees of P, and where two trees T1 and T2 are...
Ballin, J. A., Crooks, J. P., Dauncey, P. D., Mikami, Y., Miller, O. D., ...
In this paper we present a novel, quadruple well process developed in a modern 0.18mu CMOS technology called INMAPS. On top of the standard process, we have added a deep P implant that can be used to...
M. E. Houle, F. Hurtado, M. Noy, E. Rivera-campo
triangulations and perfect matchings
On the number of graphs not containing $K_{3,3}$ as a minor (2008)
Gerke, S., Gimenez, O., Noy, M., Weissl, A.
We derive precise asymptotic estimates for the number of labelled graphs not containing $K_{3,3}$ as a minor, and also for those which are edge maximal. Additionally, we establish limit laws for...
Preliminary images from an adaptive imaging system (2008)
Griffiths, J.A., Metaxas, M.G., Pani, S., Schulerud, H., Esbrand, C., Royle, G.J., ...
I-ImaS (Intelligent Imaging Sensors) is a European project aiming to produce real-time adaptive X-ray imaging systems using Monolithic Active Pixel Sensors (MAPS) to create images with maximum...
J. Galtier, F. Hurtado, M. Noy, S. Perennes, J. Urrutia
We generalize the operation of flipping an edge in a triangulation to that of flipping several edges simultaneously. Our main result is an optimal upper bound on the number of parallel flips that are...
Improved bounds for the number of forests and acyclic orientations in the square lattice (2007)
N. Calkin, S. Noble, C. Merino, M. Noy
the square lattice
M. C. Hernando, F. Hurtado, M. Mora, M. Noy
Given a set P of points in the plane, let T (P) be the set of non-crossing spanning trees of P
A MAPS-based Digital Electromagnetic Calorimeter for the ILC (2007)
Ballin, J. A., Dauncey, P. D., Noy, M., Mikami, Y., Miller, O., ...
A novel design for a silicon-tungsten electromagnetic calorimeter is described, based on Monolithic Active Pixel Sensors (MAPS). A test sensor with a pixel size of 50x50 um2 has been fabricated in...
Adaptive image content-based exposure control for scanning applications in radiography (2007)
Schulerud, H., Thielemann, J.T., Kirkhus, T., Kaspersen, K., Ostby, J.M., Metaxas, M.G., ...
A scanning system for intelligent imaging: I-ImaS (2007)
Longo, R., Asimidis, A., Cavouras, D., Esbrand, C., Fant, A., Gasiorek, P., ...
Adaptive image content-based exposure control for scanning applications in radiography (2007)
Schulerud, H., Thielemann, J.T., Kirkhus, T., Kaspersen, K., Ostby, J.M., Metaxas, M.G., ...
A scanning system for intelligent imaging: I-ImaS (2007)
Longo, R., Asimidis, A., Cavouras, D., Esbrand, C., Fant, A., Gasiorek, P., ...
CMOS Monolithic Active Pixel Sensors (MAPS): developments and future outlook (2007)
Turchetta, R., Fant, A., Gasiorek, P., Esbrand, C., Griffiths, J.A., Metaxas, M.G., ...
Re-invented in the early 1990s, on both sides of the Atlantic, Monolithic Active Pixel Sensors (MAPS) in a CMOS technology are today the most sold solid-state imaging devices, overtaking the...
CMOS Monolithic Active Pixel Sensors (MAPS): developments and future outlook (2006)
Turchetta, R., Fant, A., Gasiorek, P., Esbrand, C., Griffiths, J.A., Metaxas, M.G., ...
A multi-element detector system for intelligent imaging: I-ImaS (2006)
Griffiths, J.A., Metaxas, M.G., Royle, G.J., Venanzi, C., Esbrand, C., ...
Intelligent imaging sensors: system development and preliminary results (2006)
Speller, R.D., Royle, G.J., Griffiths, J.A., Metaxas, M.G., Li, G., ...
The CMS Tracker Readout Front End Driver (2005)
Foudas, C., Bainbridge, R., Ballard, D., Church, I., Corrin, E., Coughlan, J. A., ...
The Front End Driver, FED, is a 9U 400mm VME64x card designed for reading out the Compact Muon Solenoid, CMS, silicon tracker signals transmitted by the APV25 analogue pipeline Application Specific...
The effect of highly ionising particles on the CMS silicon strip tracker (2005)
Adam, W., Bergauer, T., Friedl, M., Fruehwirth, R., Hrubec, J., Krammer, M., ...
Inelastic nuclear collisions of hadrons incident on silicon sensors can generate secondary highly ionising particles (HIPs) and deposit as much energy within the sensor bulk as several hundred...
The effect of highly ionising particles on the CMS silicon strip tracker (2005)
Adam, W., Bergauer, T., Friedl, M., Fruehwirth, R., Hrubec, J., Krammer, M., ...
Inelastic nuclear collisions of hadrons incident on silicon sensors can generate secondary highly ionising particles (HIPs) and deposit as much energy within the sensor bulk as several hundred...
The effect of highly ionising particles on the CMS silicon strip tracker (2005)
Adam, W., Bergauer, T., Friedl, M., Fruehwirth, R., Hrubec, J., Krammer, M., ...
Inelastic nuclear collisions of hadrons incident on silicon sensors can generate secondary highly ionising particles (HIPs) and deposit as much energy within the sensor bulk as several hundred...
The effect of highly ionising particles on the CMS silicon strip tracker (2005)
Adam, W., Bergauer, T., Friedl, M., Fruehwirth, R., Hrubec, J., Krammer, M., ...
Inelastic nuclear collisions of hadrons incident on silicon sensors can generate secondary highly ionising particles (HIPs) and deposit as much energy within the sensor bulk as several hundred...
Graphs of Triangulations and Perfect Matchings (2005)
M. E. Houle, F. Hurtado, M. Noy, E. Rivera-campo
P ) of P has a vertex for every triangulation of P , and two of them are adjacent if they di#er by a single edge exchange. We prove that the subgraph (P ), consisting of all triangulations of P that...
Software and DAQ for the CMS silicon tracker front end driver (2004)
Fulcher, J., Mirabito, L., Coughlan, J.A., Illes, G., Bainbridge, R.J., Church, I., ...
Software and DAQ for the CMS silicon tracker front end driver (2004)
Fulcher, J., Mirabito, L., Coughlan, J.A., Illes, G., Bainbridge, R.J., Church, I., ...
Graphs of non-crossing perfect matchings (2002)
C. Hernando, F. Hurtado, M. Noy
Let Pn be a set of n = 2m points that are the vertices of a convex polygon, and let Mm be the graph having as vertices all the perfect matchings in the point set Pn whose edges are straight line...
Triangle-free planar graphs as segment intersection graphs (2002)
N. De Castro, F. J. Cobos, J. C. Dana, A. Márquez, M. Noy
Abstract. We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal,...
Triangle-Free Planar Graphs as Segments Intersection Graphs (1999)
De Castro, N., Cobos, F. J., Dana, J. C., Márquez, A., Noy, M.
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and...
Triangle-Free Planar Graphs as Segments Intersection Graphs (1999)
De Castro, N., Cobos, F. J., Dana, J. C., Márquez, A., Noy, M.
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and...
Triangle-Free Planar Graphs as Segments Intersection Graphs (1999)
De Castro, Natalia, Cobos, F. J., Dana, J. C., Márquez, A., Noy, M.
We prove that every triangle-free planar graph is the graph of intersection of a set of segments in the plane. Moreover, the segments can be chosen in only three directions (horizontal, vertical and...
Properties of Random Triangulations and Trees (1999)
L. Devroye, P. Flajolet, F. Hurtado, M. Noy, W. Steiger
Let T n denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation # T n , for example, # n (#...
Packing Trees into Planar Graphs (1998)
García, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J.
The main problem considered in this paper is the following: given two trees both with n vertices, whether it is possible to draw them on the plane with the same set of vertices without crossings and...
Packing Trees into Planar Graphs (1998)
García, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J.
The main problem considered in this paper is the following: given two trees both with n vertices, whether it is possible to draw them on the plane with the same set of vertices without crossings and...
Packing Trees into Planar Graphs (1998)
García, A., Hernando, C., Hurtado, F., Noy, M., Tejel, J.
The main problem considered in this paper is the following: given two trees both with n vertices, whether it is possible to draw them on the plane with the same set of vertices without crossings and...
Bipartite Embeddings of Trees in the Plane (1997)
Abellanas, Manuel, Garcìa, J., Hernández, G., Noy, M., Ramos, Pedro
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings. Now imagine the set P is partitioned...
Bipartite Embeddings of Trees in the Plane (1997)
Abellanas, Manuel, Garcìa, J., Hernández, G., Noy, M., Ramos, Pedro
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings. Now imagine the set P is partitioned...
Bipartite Embeddings of Trees in the Plane (1997)
Abellanas, Manuel, Garcìa, J., Hernández, G., Noy, M., Ramos, Pedro
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings. Now imagine the set P is partitioned...
Bipartite Embeddings of Trees in the Plane (1997)
M. Abellanas, J. García, G. Hernández, M. Noy, P. Ramos
Given a tree T on n vertices and a set P of n points in the plane in general position, it is known that T can be straight line embedded in P without crossings. The problem becomes more difficult if T...
Flipping Edges on Triangulations (1996)
F. Hurtado, M. Noy, Aplicada Ii, J. Urrutia
In this paper we study the problem of flipping edges in triangulations of polygons and point sets. We prove that if a polygon Q n has k reflex vertices, then any triangulation of Q n can be...
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice
Calkin Martin Hall, C. Merino, S. Noble, Kingston Lane, Ub Ph, M. Noy
In a recent paper Merino and Welsh (1999) studied several counting problems on the square lattice L n . There the authors gave the following bounds for the asymptotics of f(n), the number of forests...