Search Results - "output-sensitive algorithms"

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration by Golovach, Petr A., Komusiewicz, Christian, Kratsch, Dieter, Le, Van Bang

“…An enumeration kernel as defined by Creignou et al. (2017) [11] for a parameterized enumeration problem consists of an algorithm that transforms each instance…”
Get full text

A note on the problem of reporting maximal cliques by Cazals, F., Karande, C.

“…Reporting the maximal cliques of a graph is a fundamental problem arising in many areas. This note bridges the gap between three papers addressing this…”
Get full text

Scalable computational geometry in MapReduce by Li, Yuan, Eldawy, Ahmed, Xue, Jie, Knorozova, Nadezda, Mokbel, Mohamed F., Janardan, Ravi

“…Hadoop, employing the MapReduce programming paradigm, has been widely accepted as the standard framework for analyzing big data in distributed environments…”
Get full text

Distributed Alarming in the On-Duty and Off-Duty Models by Bienkowski, Marcin, Gasieniec, Leszek, Klonowski, Marek, Korzeniowski, Miroslaw, Mans, Bernard, Schmid, Stefan, Wattenhofer, Roger

“…Decentralized monitoring and alarming systems can be an attractive alternative to centralized architectures. Distributed sensor nodes (e.g., in the smart…”
Get full text

Planar lower envelope of monotone polygonal chains by Lu, Daniel L.

“…•An algorithm to find the lower envelope of monotone polygonal chains is proposed.•Simpler than known methods and requires no complex data structures.•Applies…”
Get full text

A New Approach to Output-Sensitive Construction of Voronoi Diagrams and Delaunay Triangulations by Miller, Gary L., Sheehy, Donald R.

“…We describe a new algorithm for computing the Voronoi diagram of a set of n points in constant-dimensional Euclidean space. The running time of our algorithm…”
Get full text

Enumerating trichromatic triangles containing the origin in linear time by Elmasry, Amr

“…Consider a set P of n points in the plane, where each point is associated with one of three colours. We give an output-sensitive algorithm that enumerates a…”
Get full text

Output-Sensitive Computation of Force-Closure Grasps of a Semi-Algebraic Object by Jae-Sook Cheong, Kruger, H., van der Stappen, A. F.

“…We propose a technique which significantly simplifies the computation of frictionless force-closure grasps of a curved planar part P . We use a colored…”
Get full text

Reactive Synthesis: Towards Output-Sensitive Algorithms

Get full text

Fast stabbing of boxes in high dimensions by Nielsen, Frank

“…We present in this paper a simple yet efficient algorithm for stabbing a set S of n axis-parallel boxes in d-dimensional space with c( S) points in…”
Get full text

Constructing Antidictionaries in Output-Sensitive Space by Ayad, Lorraine A.K., Badkobeh, Golnaz, Fici, Gabriele, Heliou, Alice, Pissis, Solon P.

“…A word x that is absent from a word y is called minimal if all its proper factors occur in y. Given a collection of k words y_1, y_2,...,y_k over an alphabet…”
Get full text

On point covers of [formula omitted]-oriented polygons by Nielsen, Frank

“…Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E 2 , i.e., bounded intersection of halfplanes whose normal directions of…”
Get full text

On point covers of c-oriented polygons by Nielsen, Frank

“…Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E super(2), i.e., bounded intersection of halfplanes whose normal…”
Get full text

Distribution-sensitive set multi-partitioning by Elmasry, Amr

“…Given a set $\mathcal{S}$ with real-valued members, associated with each member one of two possible types; a multi-partitioning of $\mathcal{S}$ is a sequence…”
Get full text

Efficient rendering of multiresolution meshes with guaranteed image quality by Klein, Reinhard, Schilling, Andreas

“…Output-sensitive rendering algorithms have recently generated a lot of interest. The number of triangles describing a scene was once smaller than the number of…”
Get full text

Instance-Optimal Geometric Algorithms by Afshani, P., Barbay, J., Chan, T.M.

“…We prove the existence of an algorithm A for computing 2-d or 3-dconvex hulls that is optimal for every point set in the following sense: for every set S of n…”
Get full text

On point covers of c-oriented polygons by Frank Nielsen

Get full text

Interviews3D: A Platform for Interactive Handling of Massive Data Sets by Brüderlin, Beat, Heyer, Mathias, Pfützner, Sebastian

“…lnterviews3D confronts the CAD data explosion problem with new approaches that let users process fully detailed 3D models in real time, even on standard PCs or…”
Get full text

Constant amortized time enumeration of Eulerian trails by Kurita, Kazuhiro, Wasa, Kunihiro

“…•Eulerian trails are classical and important objects in theoretical computer science field.•Enumeration of Eulerian trails is known to be #P-complete.•Although…”
Get full text

Constructing Antidictionaries of Long Texts in Output-Sensitive Space by Ayad, Lorraine A.K., Badkobeh, Golnaz, Fici, Gabriele, Héliou, Alice, Pissis, Solon P.

“…A word x that is absent from a word y is called minimal if all its proper factors occur in y . Given a collection of k words y 1 , … , y k over an alphabet Σ ,…”
Get full text