arXiv:2610.22815v1 Announce Type: new Abstract: Reachability analysis and set-based estimation for nonlinear systems require set representations capable of capturing nonconvex geometry. Hybrid Zonotopes (HZs) have recently gained attention because they can encode a union of up to $2^n$ polytopic components. Recent work has further shown that several HZ operations can be made \textit{sharp}, meaning that relaxing the binary variables yields exactly the convex hull of the represented set. However, no known HZ construction provides a sharp union of two convex sets that adds only one binary generator and no further continuous generators or equality constraints to those of the operands. This limitation affects scalability in repeated union operations, ReLU neural-network reachability, and nonlinear propagation methods that cover graph sets by unions of simpler sets. This paper identifies a connection between the exact closed-form convex-hull operation for Constrained Convex Generators (CCGs) and the binary-generator structure underlying HZs. We propose Hybrid Cones that can encode up to $2^n$ norm-cone components. Hybrid Cones inherit the logical structure of HZs while allowing richer convex components, including polytopic and norm-based sets. They support sharp unions requiring only one added binary variable and can represent unions and intersections of polytopes and ellipsoids. As a key application, we derive an exact representation of the ReLU graph using only two continuous and one binary generators. Numerical experiments for a localization problem with a nonlinear energy measurement function approximated by a neural network and the stability verification of the closed loop of a double integrator corrupted by a nonlinear disturbance with a saturated Linear Quadratic Regulator (LQR) controller show substantial reduction in representation size and reduced conservatism in comparison with HZs.